Results 1  10
of
1,551,842
Dynamic Distributed Constraint Satisfaction
 In Proceedings of the 7th Conference on Principles and Practice of Constraint Programming CP01
, 2002
"... In this paper we show that the dynamic execution model of Asynchronous Constraint Solving (ACS) can be efficiently applied to solve distributed constraint satisfaction problems. ACS defines domainindependent constraint services as blackbox reasoning engines for complex objectoriented software sys ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we show that the dynamic execution model of Asynchronous Constraint Solving (ACS) can be efficiently applied to solve distributed constraint satisfaction problems. ACS defines domainindependent constraint services as blackbox reasoning engines for complex objectoriented software
Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
, 1992
"... Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particul ..."
Abstract

Cited by 292 (24 self)
 Add to MetaCart
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
 IEEE Transactions on Knowledge and Data Engineering
, 1998
"... In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various applica ..."
Abstract

Cited by 323 (28 self)
 Add to MetaCart
In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various
On Communication in Distributed Constraint Satisfaction
"... Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multiagent coordination and conflict resolution. While interagent communication in most DCSP algorithms is restricted to only exchanging values of variables, this paper provides a detailed experimental investigation of ..."
Abstract
 Add to MetaCart
Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multiagent coordination and conflict resolution. While interagent communication in most DCSP algorithms is restricted to only exchanging values of variables, this paper provides a detailed experimental investigation
Boosting distributed constraint satisfaction
 In Int. Conf. on Principles and Practice of Constraint Programming (CP
, 2005
"... Abstract. Competition and cooperation can boost the performance of search. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for t ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
for the application of algorithms for distributed constraint satisfaction which makes use of both cooperation and competition. This framework improves the performance of two different standard algorithms by one order of magnitude and can reduce the risk of poor performance by up to three orders of magnitude. Moreover
Distributed constraint satisfaction with . . .
 CONSTRAINTS (2009 ) 14:199–234
, 2009
"... Distributed constraint satisfaction problems (DisCSPs) are composed of agents connected by constraints. The standard model for DisCSP search algorithms uses messages containing assignments of agents. It assumes that constraints are checked by one of the two agents involved in a binary constraint, he ..."
Abstract
 Add to MetaCart
Distributed constraint satisfaction problems (DisCSPs) are composed of agents connected by constraints. The standard model for DisCSP search algorithms uses messages containing assignments of agents. It assumes that constraints are checked by one of the two agents involved in a binary constraint
On the Feasibility of Distributed Constraint Satisfaction
, 1991
"... This paper characterizes connectionisttype architectures that allow a distributed solution for classes of constraintsatisfaction problems. The main issue addressed is whether there exists a uniform model of computation (where all nodes are indistinguishable) that guarantees convergence to a ..."
Abstract

Cited by 72 (12 self)
 Add to MetaCart
This paper characterizes connectionisttype architectures that allow a distributed solution for classes of constraintsatisfaction problems. The main issue addressed is whether there exists a uniform model of computation (where all nodes are indistinguishable) that guarantees convergence to a
Algorithms for Distributed Constraint Satisfaction: A Review
 In CP
, 2000
"... . When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these interagent constraints. Vario ..."
Abstract

Cited by 248 (11 self)
 Add to MetaCart
. When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these interagent constraints
Parallel Distributed Constraint Satisfaction
 In Proc. Intern. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA99
, 1999
"... A parallel distributed framework to solve constraint satisfaction problems based on connectionist ideas of distributed information processing is presented. In this approach, each variable of a given problem is associated with a simple agent continuously applying a variable manipulation rule in the s ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
A parallel distributed framework to solve constraint satisfaction problems based on connectionist ideas of distributed information processing is presented. In this approach, each variable of a given problem is associated with a simple agent continuously applying a variable manipulation rule
distributed constraint satisfaction
"... suite of secure multiparty computation algorithms for solving ..."
Results 1  10
of
1,551,842