Author:
Mailler Roger,Graves Jacob
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Benisch, M., Sadeh, N.: Examining distributed constraint satisfaction problem (dcsp) coordination tradeoffs. In: International Conference on Automated Agents and Multi-Agent Systems, AAMAS (2006)
2. Culberson, J., Gent, I.: Frozen development in graph coloring. Theoretical Computer Science 265(1-2), 227–264 (2001)
3. Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artificial Intelligence 58(1-3), 21–70 (1992)
4. Frost, D., Dechter, R.: Dead-end driven learning. In: Proceedings of the Twelfth Natioanl Conference on Artificial Intelligence, pp. 294–300 (1994)
5. Grinshpoun, T., Meisels, A.: Completeness and performance of the apo algorithm. Journal of Artificial Intelligence Research 33, 223–258 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A colored Petri net model for DisCSP algorithms;Concurrency and Computation: Practice and Experience;2017-06-29