225 search results - page 3 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
122
click to vote
AIMSA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
104
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
AAAI
1994
15 years 3 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
105
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...