Synchronous , Asynchronous and Hybrid Algorithms for DisCSPs ?

There is some debate about the kind of algorithms that are mos t suitable to solve DisCSP. Synchronous algorithms exchange upda ted information with a low degree of parallelism. Asynchronous algorithms u se less updated information with a higher parallelism. Hybrid algorithms com bine both features. Lately, there is some evidence that synchronous algorithms could be more efficient than asynchronous ones for one problem class. In this p aper, we present some improvements on existing synchronous and asynchronou s algorithms, as well as a new hybrid algorithm. We provide an empirical inves tigation of these algorithms onn-queens and binary random DisCSPs.

[1]  Amnon Meisels,et al.  Synchronous vs Asynchronous search on DisCSPs , 2003 .

[2]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[3]  Amnon Meisels,et al.  Comparing performance of distributed constraints process ing algorithms , 2002 .

[4]  Patrick Prosser,et al.  Domain Filtering can Degrade Intelligent Backtracking Search , 1993, IJCAI.

[5]  Christian Bessiere,et al.  Distributed Dynamic Backtracking , 2001, CP.

[6]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[7]  Marius-Calin Silaghi,et al.  Asynchronous Search with Aggregations , 2000, AAAI/IAAI.

[8]  Christian Bessiere,et al.  Backtracking in Distributed Constraint Networks , 1998 .

[9]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[10]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[11]  M. Silaghi,et al.  Hybridizing ABT and AWC into a polynomial space, complete protocol with reordering , 2001 .

[12]  Makoto Yokoo,et al.  Search algorithms for agents , 1999 .

[13]  Makoto Yokoo,et al.  Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information , 2002, CP.

[14]  Makoto Yokoo,et al.  Secure distributed constraint satisfaction: reaching agreement without revealing private information , 2002, Artif. Intell..

[15]  Makoto Yokoo.  Distributed Constraint Satisfaction Problem , 2001 .

[16]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[17]  Makoto Yokoo,et al.  The effect of nogood learning in distributed constraint satisfaction , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[18]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[19]  Bhaskar Krishnamachari,et al.  Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[20]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..