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 Dynamic Distributed BackJumping - DDBJ algorithm. The advantage is twofold: 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 DDBJ outperforms the DiDB and AFC algorithms by a factor of one to two orders of magnitude on hard instances of randomly generated DisCSPs. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Nguyen, V., Sam-Haroud, D., & Fallings, B. (2005). Dynamic distributed BackJumping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3419 LNAI, pp. 71–85). https://doi.org/10.1007/11402763_6
Mendeley helps you to discover research relevant for your work.