Results 1 - 10 of 45

Parallel and distributed algorithms for finite constraint satisfaction problems

by Ying Zhang, Alan K. Mackworth - in Proc. of Third IEEE Symposium on Parallel and Distributed Processing , 1991
"... This paper develops two new algorithms for solv-ing a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. If an FCSP can be represented by an acyclic cons ..."
Abstract - Cited by 41 (2 self) - Add to MetaCart
This paper develops two new algorithms for solv-ing a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. If an FCSP can be represented by an acyclic

Qualitative Preference Modelling in Constraint

by Yannis Dimopoulos, Pavlos Moraitis, Alexis Tsoukiàs
"... Abstract. The paper addresses the problem of finding an appropriate formalism for the representation of preferences expressed on an n-dimensional space of attributes and on different layers: generic, contextual and structural preferences. The paper first introduces a general framework for preference ..."
Abstract - Add to MetaCart
for preference modelling and then specialises it for the multi-layer case. It then shows that in the case we privilege computational efficiency an appropriate formalism can be the CP-nets one. More precisely we show how contextual and structural preferences can be seen as different types of constraint

An Evolutionary Constraint Satisfaction Solution for Over The Cell Channel Routing

by Ahmet Ünveren, Adnan Acan
"... Abstract. A novel evolutionary approach for ordering assignments in combinatorial optimization using constraint satisfaction problem (CSP) modeling is presented. In assignment of values to variables, the order of assignments is determined through evolutionary optimization exploiting problem specific ..."
Abstract - Add to MetaCart
Abstract. A novel evolutionary approach for ordering assignments in combinatorial optimization using constraint satisfaction problem (CSP) modeling is presented. In assignment of values to variables, the order of assignments is determined through evolutionary optimization exploiting problem

Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments

by Ying Zhang, Alan K. Mackworth , 1992
"... This paper explores the parallel complexity of finite constraint satisfaction problems (FCSPs) by developing three algorithms for deriving minimal constraint networks in parallel. The first is a parallel algorithm for the EREW PRAM model, the second is a distributed algorithm for fine-grain intercon ..."
Abstract - Cited by 14 (1 self) - Add to MetaCart
This paper explores the parallel complexity of finite constraint satisfaction problems (FCSPs) by developing three algorithms for deriving minimal constraint networks in parallel. The first is a parallel algorithm for the EREW PRAM model, the second is a distributed algorithm for fine

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
, in uenced by their speci c experience. There is another layer that is folded in production/consumption, experience, power, and culture. This is technology. By technology I mean 'the use of scienti c knowledge to specify ways of doing things in a reproducible manner'. Technology is embodied

A distributed connectionist production system

by David S. Touretzky, Geoffrey E. Hinton - Cognitive Science , 1988
"... DCPS is a connectionist production system interpreter that uses distributed repre-sentations. As a connectionist model it consists of many simple, richly intercon-nected neuron-like computing units that cooperate to solve problems in parallel. One motivation far constructing DCPS was to demonstrate ..."
Abstract - Cited by 82 (4 self) - Add to MetaCart
DCPS is a connectionist production system interpreter that uses distributed repre-sentations. As a connectionist model it consists of many simple, richly intercon-nected neuron-like computing units that cooperate to solve problems in parallel. One motivation far constructing DCPS was to demonstrate

Preference Propagation In Temporal/Capacity Constraint Graphs

by Norman Sadeh, Mark S. Fox , 1989
"... Scheduling can be formalized as a constraint satisfaction problem (CSP). Within this framework activities in a plan are interconnected via temporal relation constraints a la Allen, thereby defining a temporal constraint graph (TCG). Additionally there are capacity constraints restricting the use of ..."
Abstract - Cited by 18 (6 self) - Add to MetaCart
Scheduling can be formalized as a constraint satisfaction problem (CSP). Within this framework activities in a plan are interconnected via temporal relation constraints a la Allen, thereby defining a temporal constraint graph (TCG). Additionally there are capacity constraints restricting the use

Parallel and distributed algorithms for constraint networks

by Ying Zhang, Alan K. Mackworth , 1991
"... This paper develops two new algorithms for solving a nite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. Both of these algorithms are derived from arc consi ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
This paper develops two new algorithms for solving a nite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. Both of these algorithms are derived from arc

Distributed Search in Railway Scheduling Problems

by Montserrat Abril, Miguel A. Salido, Federico Barber
"... Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be mo ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can

Application of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem

by Montserrat Abril, Miguel A. Salido, Federico Barber
"... Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be mo ..."
Abstract - Add to MetaCart
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can
Results 1 - 10 of 45