This is a preview of subscription content, log in via an institution.
References
R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34:1–38, 1988.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268–299, 1993.
P. Prosser, C. Conway, and M. Muller. A constraint maintenance system for the distributed resource allocation problem. Intelligent Systems Engineering, pages 76–83, 1992.
K. Sycara, F. Roth, N. Sadeh, and M. Fox. Resource allocation in distributed factory scheduling. IEEE Expert, pages 29–40, 1991.
M. Yokoo. Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Proc. 1st Intrnat. Conf. on Const. Progr., pages 88–102, Cassis, France, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solotorevsky, G., Gudes, E., Meisels, A. (1996). Modeling and solving distributed constraint satisfaction problems (DCSPs). In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_116
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive