Sciweavers

Share
CSCLP
2004
Springer

Dynamic Distributed BackJumping

9 years 6 months ago
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 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.
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CSCLP
Authors Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
Comments (0)
books