Dynamic ordering for asynchronous backtracking on disCSPs

Constraints

Volumn 11, Issue 2-3, 2006, Pages 179-197

  Zivan, Roie ^a   Meisels, Amnon ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distributed AI; Distributed Constraint satisfaction; Search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC LOADS; HEURISTIC METHODS; MULTI AGENT SYSTEMS; POLYNOMIALS;

ASYNCHRONOUS BACKTRACKING; DISTRIBUTED AI; DISTRIBUTED CONSTRAINT SATISFACTION; DYNAMIC ORDERING; SEARCH;

CONSTRAINT THEORY;

EID: 33745200557     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-006-8062-0     Document Type: Conference Paper

References (29)

1. Bacchus, F., & van Run, P. (1995). Dynamic variable ordering in csps. In Proc. Principles and Practice of Constraint Programming (CP-95) (pp. 258-275).
2. Bessiere, C., Maestre, A., Brito, I., & Meseguer, P. (2005). Asynchronous backtracking without adding links: A new member in the abt family. Artificial Intelligence, 161(1-2), 7-24 (January).
3. Bessiere, C., Maestre, A., & Messeguer, P. (2001). Distributed dynamic backtracking. In Proc. Workshop on Distributed Constraint of IJCAI01.
4. Bessiere, C., & Regin, J. C. (1995). Using bidirectionality to speed up arc-consistency processing. Constraint Processing (LNCS 923) (pp. 157-169).
5. Brito, I., & Meseguer, P. (2004). Synchronous,asnchronous and hybrid algorithms for discsp. In Workshop on Distributed Constraints Reasoning (DCR-04) CP-2004. Toronto (September).
6. Dechter, R. (2003). Constraint Processing. Morgan Kaufman.
7. Frost, D., & Dechter, R. (1994). In search of the best constraint satisfaction search. In Proc. Twelfth National Conference of Artificial Intelligence (AAAI-94) (pp. 301-306). Seattle, USA (August).
8. Gent, I. P., MacIntyre, E., Prosser, P., Smith, Barbara M., & Walsh, T. (1996). An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Principles and Practice of Constraint Programming (pp. 179-193).
9. Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.
10. Hamadi, Y. (2001). Distributed interleaved parallel and cooperative search in constraint satisfaction networks. In Proc. IAT-01. Singapore.
11. Hamadi, Y., & Bessiere, C. (1998). Backtracking in distributed constraint networks. In Proc. ECAI-98 (pp. 219-223). Brighton (August).
12. Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263-313.
13. Lamport, L. (1978). Time, clocks, and the ordering of events in distributed system. Communications of the ACM, 2, 95-114 (April).
14. Lynch, N. A. (1997). Distributed Algorithms. Morgan Kaufmann Series.
15. Meisels, A., Razgon, I., Kaplansky, E., & Zivan, R. (2002). Comparing performance of distributed constraints processing algorithms. In Proc. AAMAS-2002 Workshop on Distributed Constraint Reasoning DCR (pp. 86-93). Bologna (July).
16. Meisels, A., & Zivan, R. (2003). Asynchronous forward-checking for distributed csps. In W. Zhang (Ed.), Frontiers in Artificial Intelligence and Applications. IOS.
17. Nguyen, T., Sam-Hroud, D., & Faltings, B. (2004). Dynamic distributed backjumping. In Proc. 5th Workshop on Distributed Constraints Reasoning DCR-04. Toronto (September).
18. Prosser, P. (1993). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268-299.
19. Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81, 81-109.
20. Silaghi, M. C., & Faltings, B. (2005). Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial Intelligence, 161(1-2), 25-54 (January).
21. Silaghi, M. C., Sam-Haroud, D., & Faltings, B. (2001). Hybridizing abt and awe into a polynomial space, complete protocol with reordering. Technical Report 01/#364, EPFL (May).
22. Smith, B. M. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 155-181.
23. Solotorevsky, G., Gudes, E., & Meisels, A. (1996). Modeling and solving distributed constraint satisfaction problems (dcsps). In Constraint Processing-96, (short paper) (pp. 561-562). Cambridge, Massachusetts, USA (October).
24. Yokoo, M. (1995). Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Proc. 1st Intrnat. Conf. on Const. Progr. (pp. 88-102). Cassis, France.
25. Yokoo, M. (2000). Algorithms for distributed constraint satisfaction problems: A review. Autonomous Agents & Multi-Agent Sys., 3, 198-212.
26. Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). Distributed constraint satisfaction problem: Formalization and algorithms. IEEE Trans. Data Kn. Eng., 10, 673-685.
27. Zivan, R., & Meisels, A. (2003). Synchronous vs asynchronous search on discsps. In Proc. 1st European Workshop on Multi Agent System, EUMAS. Oxford (December).
28. Zivan, R., & Meisels, A. (2006). Message delay and asynchronous discsp search. Archives of Control, (accepted for publication).
29. Zivan, R., & Meisels, A. (2006). Message delay and discsp search algorithms. Annals of Mathematics and Artificial Intelligence (AMAI), (accepted for publication).