Boosting distributed constraint satisfaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 549-562

  Ringwelski, Georg ^a   Hamadi, Youssef ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; PARALLEL ALGORITHMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONSTRAINT SATISFACTION; DISTRIBUTED CONSTRAINT SATISFACTION; STANDARD ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646189864     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_41     Document Type: Conference Paper

References (15)

1. [BBMM05] C. Bessiere, I. Brito, A. Maestre, and P. Meseguer. Asynchronous back-tracking without; adding links: A new member in the ABT family. Artificial Intelligence, 161:7-24, 2005.
2. [CB04] T. Carchrae and J. C. Beck. Low knowledge algorithm control. In Proc. AAAI'04, 2004.
3. [FM02] S. Fitzpatrick and L. Meertens. Scalable, anytime constraint optimization through iterated, peer-to-peer interaction in sparsely-connected networks. In Proc. IDPT'02, 2002.
4. [GS97] C.P. Gomes and B. Selman. Algorithm portfolio design: Theory vs. practice. In Proc. UAI'97, pages 190-197, 1997.
5. [GS01] C.P. Gomes and B. Selman. Algorithm portfolios. Artificial Intelligence, 126:43-62, 2001.
6. [GSK98] C.P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proc. AAAI'98, pages 431-438. AAAI Press, 1998.
7. [Ham99] Y. Hamadi. Optimal distributed arc-consistency. In Proc. CP'99, pages 219-233, 1999.
8. [Ham02] Y. Hamadi. Interleaved backtracking in distributed constraint networks. International Journal on Artificial Intelligence Tools, 11(2):167-188, 2002.
9. [HBQ98] Y. Hamadi, C. Bessiere, and J. Quinqueton. Backtracking in distributed constraint networks. In Proc. ECAI'98, pages 219-223, 1998.
10. [HH93] T. Hogg and B. A. Huberman. Better than the best: The power of cooperation. In 1992 Lectures in Complex Systems, volume V of SFI Studies in the Sciences of Complexity, pages 165-184. Addison-Wesley, 1993.
11. +03] K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham. A portfolio approach to algorithm selection. In Proc. IJCAI'03, page 1542, 2003.
12. [Pug04] J. F. Puget. Some challenges for constraint programming: an industry view. In Proc. CP'04, invited talk, pages 5-9. Springer LNCS 3258, 2004.
13. [Ric76] J. R. Rice. The algorithm selection problem. Advances in Computers, 15:65-118, 1976.
14. [YDIK92] M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In Proc. ICDCS'9S, pages 614-621, 1992.
15. [ZM03] R. Zivan and A. Meisels. Synchronous vs asynchronous search on DisCSPs. In Proc. EUMAS'03, 2003.