Problem structure and subproblem sharing in multi-agent systems

Proceedings - International Conference on Multi Agent Systems, ICMAS 1998

Volumn , Issue , 1998, Pages 174-181

  Mammen, Dorothy L ^a   Lesser, Victor R ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; DISTRIBUTED COMPUTER SYSTEMS; ECONOMIC AND SOCIAL EFFECTS; PROBLEM SOLVING;

DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; DOMAIN INDEPENDENTS; MULTI-AGENT PROBLEMS; PARAMETERIZED; PROBLEM STRUCTURE; PROCESSING TIME; TAKE BACKS; TRADE OFF;

MULTI AGENT SYSTEMS;

EID: 85035990259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMAS.1998.699047     Document Type: Conference Paper

References (13)

1. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 331-337, Sydney, Australia, 1991.
2. K. S. Decker. Distributed artificial intelligence testbeds. In G. O'Hare and N. Jennings, editors, Foundations of Distributed Artificial Intelligence, chapter 3. Wiley Inter-Science, 1995. Forthcoming.
3. K. S. Decker and V. R. Lesser. Quantitative modeling of complex computational task environments. In Proceedings of the. Eleventh National Conference on Artificial Intelligence, pages 217-224, Washington', DC, USA, 1993.
4. E. H. Durfee, V. R. Lesser, and D. D. Corkill. Coherent cooperation among communicating problem solvers. IEEE Transactions on Computers, 36(11): 1275-1291, 1987.
5. T. Hogg and C. P. Williams. The hardest constraint problems: A double phase transition. Artificial Intelligence, 69:359-377, 1994.
6. D. L. Mammen and T. Hogg. A new look at the easy-hard-easy pattern of combinatorial search difficulty. Journal of Artificial Intelligence Research, 6:47-66, 1997.
7. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 459-465, San Jose, CA, USA, 1992.
8. B. M. Smith. Phase transition and the mushy region in constraint satisfaction problems. In A. Cohn, editor, Proceedings of the ECAI-94, pages 100-104. John Wiley and Sons, 1994.
9. K. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6): 1446-1461, 1991.
10. C. P. Williams and T. Hogg. Using deep structure to locate hard problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 472-477, San Jose, CA, USA, 1992.
11. C. P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.
12. M. Yokoo. Asynchronous weak-commitment search for solving distributed constraint satisfaction. In Proceedings of the First International Conference on Principles and Practices of Constraint Programming (CP-95), pages 407-422, Cassis, France, 1995.
13. M. Yokoo and E. Durfee. Distributed search formalisms for distributed problem solving. In Proceedings of the Eleventh International Workshop on Distributed Artificial Intelligence, pages 371-390, Glen Arbor, MI, USA, 1992.