Consistency maintenance for ABT

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

Volumn 2239, Issue , 2001, Pages 271-285

  Silaghi, Marius Călin ^a   Sam Haroud, Djamila ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING ALGORITHMS;

ASYNCHRONOUS ALGORITHMS; CENTRALIZED ALGORITHMS; COMPUTATIONAL POWER; CONSISTENCY ENFORCEMENT; CONSISTENCY MAINTENANCE; EXPERIMENTAL EVALUATION; SEARCH ALGORITHMS; TIMING VARIATIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947932545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_19     Document Type: Conference Paper

References (25)

1. J.-F. Baget and Y. S. Tognetti. Backtracking through biconnected components of a constraint graph. In Proc. of IJCAI-01, pages 291–296, 2001.
2. B. Baudot and Y. Deville. Analysis of distributed arc-consistency algorithms. Technical Report RR-97-07, U. Catholique Louvain, 97.
3. C. Bessière, A. Maestre, and P. Meseguer. Distributed dynamic backtracking. In Proc. IJCAI DCR Workshop, pages 9–16, 2001.
4. Z. Collin, R. Dechter, and S. Katz. Self-stabilizing distributed constraint satisfaction. Chicago Journal of Theoretical Computer Science, 2000.
5. J. Denzinger. Tutorial on distributed knowledge based search. IJCAI-01, August 2001.
6. E.C. Freuder, M. Minca, and R. J. Wallace. Privacy/efficiency tradeoffs in distributed meeting scheduling by constraint-based agents. In Proc. IJCAI DCR Workshop, pages 63–72, 2001.
7. M. Hannebauer. On proving properties of concurrent algorithms for distributed csps. In Proc. of CP-01 DisCS Workshop. EPFL, 2000.
8. W. Havens. Nogood caching for multiagent backtrack search. In Proc. AAAI’97 Constraints and Agents Workshop,’97.
9. S. Kasif. On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence, 45(3):275–286, October 90.
10. P. Meseguer and M. A. Jiménez. Distributed forward checking. In Proceedings of the International Workshop on Distributed Constraint Satisfaction. CP’00, 2000.
11. D. Sabin and E. C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proceedings ECAI-94, pages 125–129, 94.
12. M.-C. Silaghi, Ş. Sabău, D. Sam-Haroud, and B.V. Faltings. Asynchronous search for numeric DisCSPs. In Proc. of CP’2001, Paphos, Cyprus, 2001.
13. M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. ABT with Asynch. Reordering. In IAT, 01.
14. M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Asynchronous search with aggregations. In Proc. of AAAI2000, pages 917–922, 2000.
15. M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Maintaining hierarchical distributed consistency. In Proc. of CP-00 Workshop on DisCS, 2000.
16. M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Multiply asynchronous search with abstractions. In IJCAI-01 DCR Workshop, pages 17–32, Seattle, August 2001.
17. M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Search techniques for non-liniar constraint satisfaction problems with inequalities. In Proc. of AI2001, Otawa, June 2001.
18. M.-C. Silaghi, D. Sam-Haroud, and B.V. Faltings. Hybridyzing ABT and AWC into a polynomial space, complete protocol with reordering. Technical Report #364, EPFL, May 2001.
19. M.C. Silaghi and B. Faltings. Parallel proposals in asynchronous search. Technical Report #371, EPFL, August 2001.
20. G. Solotorevsky, E. Gudes, and A. Meisels. Distributed Constraint Satisfaction Problems - a model and application. Preprint: http://www.cs.bgu.ac.il/˜am, 97.
21. G. Tel. Multiagent Systems, A Modern Approach to Distributed AI, chapter Distributed Control Algorithms for AI, pages 539–580. MIT Press, 99.
22. E. H. Turner and J. Phelps. Determining the usefulness of information from its use during problem solving. In Proceedings of AA2000, pages 207–208, 2000.
23. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In ICDCS’92, pages 614–621, June 92.
24. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The Distributed CSP: Formalization and algorithms. IEEE Trans. on KDE, 10(5):673–685, 98.
25. Y. Zhang and A. K. Mackworth. Parallel and distributed algorithms for finite constraint satisfaction problems. In Proc. of Third IEEE Symposium on Parallel and Distributed Processing, pages 394–397, 91.