Abstract
Competition and cooperation can boost the performance of search. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for the application of algorithms for distributed constraint satisfaction which makes use of both cooperation and competition. This framework improves the performance of two different standard algorithms by one order of magnitude and can reduce the risk of poor performance by up to three orders of magnitude. Moreover it greatly reduces the classical idleness flaw usually observed in distributed hierarchy-based searches. We expect our new methods to be similarly beneficial for any tree-based distributed search and describe ways on how to incorporate them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessiere, C., Brito, I., Maestre, A., Meseguer, P.: Asynchronous backtracking without adding links: A new member in the ABT family. Artificial Intelligence 161, 7–24 (2005)
Carchrae, T., Beck, J.C.: Low knowledge algorithm control. In: Proc. AAAI 2004 (2004)
Fitzpatrick, S., Meertens, L.: Scalable, anytime constraint optimization through iterated, peer-to-peer interaction in sparsely-connected networks. In: Proc. IDPT 2002 (2002)
Gomes, C.P., Selman, B.: Algorithm portfolio design: Theory vs. practice. In: Proc. UAI 1997, pp. 190–197 (1997)
Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126, 43–62 (2001)
Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proc. AAAI 1998, pp. 431–438. AAAI Press, Menlo Park (1998)
Hamadi, Y.: Optimal distributed arc-consistency. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 219–233. Springer, Heidelberg (1999)
Hamadi, Y.: Interleaved backtracking in distributed constraint networks. International Journal on Artificial Intelligence Tools 11(2), 167–188 (2002)
Hamadi, Y., Bessiere, C., Quinqueton, J.: Backtracking in distributed constraint networks. In: Proc. ECAI 1998, pp. 219–223 (1998)
Hogg, T., Huberman, B.A.: Better than the best: The power of cooperation. In: 1992 Lectures in Complex Systems. SFI Studies in the Sciences of Complexity, vol. V, pp. 165–184. Addison-Wesley, Reading (1993)
Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc. IJCAI 2003, p. 1542 (2003)
Puget, J.F.: Some challenges for constraint programming: an industry view. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 5–8. Springer, Heidelberg (2004) (invited talk)
Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65–118 (1976)
Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proc. ICDCS 1992, pp. 614–621 (1992)
Zivan, R., Meisels, A.: Synchronous vs asynchronous search on DisCSPs. In: Proc. EUMAS 2003 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ringwelski, G., Hamadi, Y. (2005). Boosting Distributed Constraint Satisfaction. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_41
Download citation
DOI: https://doi.org/10.1007/11564751_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)