Results 1  10
of
10,455
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 326 (27 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
An approach to Symmetry Breaking in Distributed Constraint Satisfaction Problems
"... Abstract. Symmetry breaking in Distributed Constraint Satisfaction Problems (DisCSPs) has, to the best of our knowledge, not been investigated. In this paper, we show that most symmetries in DisCSPs are actually weak symmetries, and we demonstrate how weak symmetry breaking techniques can be applied ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Symmetry breaking in Distributed Constraint Satisfaction Problems (DisCSPs) has, to the best of our knowledge, not been investigated. In this paper, we show that most symmetries in DisCSPs are actually weak symmetries, and we demonstrate how weak symmetry breaking techniques can
Strategies for distributed constraint satisfaction problems
 In Proc. of the 13th International Workshop on DAI
, 1994
"... Constraint satisfaction problems are important in AI. Various distributed and parallel computing strategies have been proposed to solve these problems. In this paper, these strategies are classified as distributedagentbased, parallelagentbased, and functionagentbased distributed problemsolvin ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Constraint satisfaction problems are important in AI. Various distributed and parallel computing strategies have been proposed to solve these problems. In this paper, these strategies are classified as distributedagentbased, parallelagentbased, and functionagentbased distributed problem
Distributed Constraint Satisfaction Problems – Systematic Review 1
"... Constraint Satisfaction problems are well known problems in theoretical computer science and social sciences, and its variance, Distributed constraint Satisfaction problem is a major thrust of research nowadays. A constraint satisfaction problem can be modeled with following some rules and finish th ..."
Abstract
 Add to MetaCart
Constraint Satisfaction problems are well known problems in theoretical computer science and social sciences, and its variance, Distributed constraint Satisfaction problem is a major thrust of research nowadays. A constraint satisfaction problem can be modeled with following some rules and finish
Constraint relaxation in distributed constraint satisfaction problems
 In: Proceedings of ICTAI’03
, 1993
"... The distributed constraint satisfaction problem (DCSP) formulation has recently been identi ed as a general framework for formalizing various Distributed Arti cial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. Wi ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
The distributed constraint satisfaction problem (DCSP) formulation has recently been identi ed as a general framework for formalizing various Distributed Arti cial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints
Heuristic Search for Distributed Constraint Satisfaction Problems
 Department of Computer Science, University of Strathclyde, Glasgow
, 1993
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classified as variablebased ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classified as variable
Distributed Constraint Satisfaction Problems  A Model and Application
, 1997
"... A canonical model for distributed constraint satisfaction problems (DCSP) is presented and algorithms for processing constraints on a DCSP are described. The central idea behind a constraint network that is given as a DCSP is the existence of large differences between the cost of message passing amo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A canonical model for distributed constraint satisfaction problems (DCSP) is presented and algorithms for processing constraints on a DCSP are described. The central idea behind a constraint network that is given as a DCSP is the existence of large differences between the cost of message passing
On communication in solving distributed constraint satisfaction problems
 In MultiAgent Systems and Applications IV, Proc. 4th International Central and Eastern European Conference on MultiAgent Systems, CEEMAS 2005
, 2005
"... Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multiagent coordination and conflict resolution. In most DCSP algorithms, interagent communication is restricted to only exchanging values of variables, since any additional informationexchange is assumed to ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multiagent coordination and conflict resolution. In most DCSP algorithms, interagent communication is restricted to only exchanging values of variables, since any additional informationexchange is assumed
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems ⋆
"... Abstract. The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, multiple local variables may be required within each autonomous agent. A number of heuristics have been developed ..."
Abstract
 Add to MetaCart
Abstract. The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, multiple local variables may be required within each autonomous agent. A number of heuristics have been developed
Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems
, 1996
"... This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributedbreakout algorithm, which is inspired by the breakout algorithm for solving centralized CSPs. In this algorithm, each agent tries to optimize its evaluation valu ..."
Abstract

Cited by 103 (15 self)
 Add to MetaCart
This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributedbreakout algorithm, which is inspired by the breakout algorithm for solving centralized CSPs. In this algorithm, each agent tries to optimize its evaluation
Results 1  10
of
10,455