Asynchronous weak-commitment search for solving distributed constraint satisfaction problems

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

Volumn 976, Issue , 1995, Pages 88-102

  Yokoo, Makoto ^a  

^a Nippon Telegraph and Telephone Corporation   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DECISION MAKING; DISTRIBUTED COMPUTER SYSTEMS; INTELLIGENT AGENTS; QUEUEING THEORY; SOFTWARE AGENTS;

ALGORITHM FOR SOLVING; APPLICATION PROBLEMS; AUTOMATED AGENTS; BACKTRACKING ALGORITHM; DISTRIBUTED ARTIFICIAL INTELLIGENCE; DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; HIERARCHICAL ORDER; SEARCH ALGORITHMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84958042223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60299-2_6     Document Type: Conference Paper

References (14)

1. Chandy, K. and Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems, ACM Trans. on Computer Systems, Vol. 3, No. 1, (1985) 63-75
2. Collin, Z., Dechter, R., and Katz, S.: On the Feasibility of Distributed Constraint Satisfaction, Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (1991) 318-324
3. Conry, S. E., Kuwabara, K., Lesser, V. R., and Meyer, R. A.: Multistage Negotiation for Distributed Constraint Satisfaction, IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, (1991) 1462-1477
4. Dechter, R. and Pearl, J.: Network-based Heuristics for Constraint Satisfaction Problems, Artificial Intelligence, Vol. 34, No. 1, (1988) 1-38
5. Huhns, M. N. and Bridgeland, D. M.: Multiagent Truth Maintenance, IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, (1991) 1437-1445
6. Minton, S., Johnston, M. D., Philips, A. B., and Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduhng problems, Artificial Intelligence, Vol. 58, No. 1-3, (1992) 161-205
7. Morris, P.: The Breakout Method for Escaping From Local Minima, Proceedings of the Eleventh National Conference on Artificial Intelligence (1993) 40-45
8. Nishibe, Y., Kuwabara, K., Ishida, T., and Yokoo, M.: Speed-Up of Distributed Constraint Satisfaction and Its Application to Communication Network Path Assignments, Systems and Computers in Japan, Vol. 25, No. 12, (1994) 54-67
9. Sycara, K. P., Roth, S., Sadeh, N., and Fox, M.: Distributed Constrained Heuristic Search, IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, (1991) 1446-1461
10. Yamaguchi, H., Fujii, H., Yamanaka, Y., and Yoda, I.: Network Configuration Management Database, NTT R & D, Vol. 38, No. 12, (1989) 1509-1518
11. Yokoo, M.: Dynamic Variable/Value Ordering Heuristics for Solving Large-Scale Distributed Constraint Satisfaction Problems, l2th International Workshop on Distributed Artificial Intelligence (1993) 407-422
12. Yokoo, M.: Weak-commitment Search for Solving Constraint Satisfaction Problems, Proceedings of the Twelfth National Conference on Artificial Intelligence (1994) 313-318
13. Yokoo, M., Durfee, E. H., Ishida, T., and Kuwabara, K.: Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving, Proceedings of the Twelfth IEEE International Conference on Distributed Computing Systems (1992) 614-621
14. Zhang, Y. and Mackworth, A.: Parallel and distributed algorithms for finite constraint satisfaction problems, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing (1991) 394-397