Dynamic Distributed BackJumping

We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed version of the centralized BackJumping algorithm, called the {\\it Dynamic Distributed BackJumping} - \\algoname{DDBJ} algorithm. The advantage is twofold: \\algoname{DDBJ} inherits the strength of synchronous algorithms that enables it to easily combine with a powerful dynamic ordering of variables and values, and still it maintains some level of autonomy for the agents. Experimental results show that \\algoname{DDBJ} outperforms the \\algoname{DiDB} and \\algoname{AFC} algorithms by a factor of {\\it one to two} orders of magnitude on hard instances of randomly generated DisCSPs.


Published in:
Recent Advances in Constraints, pp.71-85
Year:
2005
Publisher:
Springer-Verlag
Note:
Lecture Notes in Computer Science Series
LNAI-3419
CSCLP04, Lausanne, Switzerland, 2004
Laboratories:




 Record created 2006-12-07, last modified 2018-01-27

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)