Communication and computation in distributed CSP algorithms

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

Volumn 2470, Issue , 2002, Pages 664-679

  Fernàndez, César ^a   Béjar, Ramón ^a   Krishnamachari, Bhaskar ^b   Gomes, Carla ^b  

^a UNIVERSITY OF LLEIDA   (Spain)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DISCRETE EVENT SIMULATION; DISTRIBUTED DATABASE SYSTEMS;

DISCRETE-EVENT NETWORK SIMULATORS; DISTRIBUTED CSP; DISTRIBUTED SYSTEMS; IMPROVE PERFORMANCE; NETWORK TRAFFIC; NETWORK TRAFFIC DISTRIBUTION; OVERALL NETWORKS; RESTART STRATEGY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 38949111165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_44     Document Type: Conference Paper

References (20)

1. R. Béjar, B. Krishnamachari, C. Gomes, and B. Selman. Distributed constraint satisfaction in a wireless sensor tracking system. In Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence, Seattle, Washington, August 2001. http://liawww.epfl.ch/ silaghi/proc wsijcai01.html.
2. S. E. Conry, K. Kuwabara, V.R. Lesser, and R.A. Meyer. Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man, and Cybernetics (Special Section on DAI), 21(6):1462–1477, 1991.
3. M. Crovella and A. Bestavros. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. IEEE Transactions on Networking, 5(6):835–846, December 1997.
4. C.P. Gomes, B. Selman, and H.A. Kautz. Boosting combinatorial search through randomization. In AAAI/IAAI, pages 431–437, 1998
5. M. Junius, M. Büter, D. Pesch, et al. CNCL. Communication Networks Class Library. Aachen University of Technology. 1996.
6. D. Kirkpatrick and P. Hell. On the complexity of general graph factor problems. SIAM Journal of Computing, 12(3):601–608, 1983.
7. B. Krishnamachari. Phase Transitions, Structure, and Complexity in Wireless Networks. PhD thesis, Electrical Engineering, Cornell University, Ithaca, NY, May 2002
8. B. Krishnamachari, R. Béjar, and S.B. Wicker. Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks. In Hawaii International Conference on System Sciences (HICSS-35), January 2002.
9. W. Leland, M. Taqqu, W. Willinger, and D. Wilson. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE Transactions on Networking, 2(1):1– 15, February 1994.
10. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic’phase transitions’. Nature, 400:133–137, July 1999.
11. V. Paxson and S. Floyd. Wide area traffic: the failure of Poisson modeling. IEEE/ ACM Transactions on Networking, 3(3):226–244, 1995.
12. G. Samorodnitsky and M. S. Taqqu. Stable Non-Gaussian Random Processes. Chapman & Hall, 1994.
13. Sanders and Air Force Research Lab. ANTs challenge problem. http://www.sanders.com/ants/overview-05-09.pdf, 2000
14. 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.
15. T. Walsh. The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT. APES Report, APES-37-2002, 2002.
16. M. Yokoo. Weak-commitment search for solving constraint satisfaction problems. In Proceedings of the 12th Conference on Artificial Intelligence (AAAI-94), pages 313–318, 1994.
17. M. Yokoo. Asynchronous weak-commiment search for solving distributed constraint satisfaction problems. In Proccedings of the First International Conference on Principles and Practice of Constraint Programming (CP-95), pages 88–102, 1995
18. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In Proccedings of the Twelfth IEEE International Conference on Distributed Computing Systems, pages 614–621, 1992
19. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge Data Engineering, 10(5):673–685, 1998
20. M. Yokoo and K. Hirayama. Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 3(2):198–212, 2000