Distributed constraint satisfaction with partially known constraints
暂无分享,去创建一个
Amnon Meisels | Pedro Meseguer | Roie Zivan | Ismel Brito | Roie Zivan | P. Meseguer | Ismel Brito | A. Meisels
[1] Patrick Prosser,et al. An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..
[2] Pedro Meseguer,et al. Distributed Stable Matching Problems , 2005, CP.
[3] Eugene C. Freuder,et al. Constraint - based multi - agent meeting scheduling: Effects of agent heterogeneity on performance a , 2002 .
[4] Amnon Meisels,et al. Message delay and DisCSP search algorithms , 2006, Annals of Mathematics and Artificial Intelligence.
[5] Michael D. Smith,et al. Improving privacy in distributed constraint optimization , 2007 .
[6] Kobbi Nissim,et al. Secure DisCSP Protocols – From Centralized Towards Distributed Solutions , 2005 .
[7] Marius-Calin Silaghi,et al. Distributed constraint satisfaction and optimization with privacy enforcement , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..
[8] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..
[9] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[10] Amnon Meisels,et al. Dynamic Ordering for Asynchronous Backtracking on DisCSPs , 2005, Constraints.
[11] Amnon Meisels,et al. Using additional information in DisCSPs search , 2004 .
[12] Makoto Yokoo,et al. Secure distributed constraint satisfaction: reaching agreement without revealing private information , 2002, Artif. Intell..
[13] Marius-Calin Silaghi,et al. Asynchronous Search with Aggregations , 2000, AAAI/IAAI.
[14] Milind Tambe,et al. Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications , 2006, Autonomous Agents and Multi-Agent Systems.
[15] Ehud Gudes,et al. Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs) , 1996, CP.
[16] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[17] Leslie Lamport,et al. Distributed snapshots: determining global states of distributed systems , 1985, TOCS.
[18] Makoto Yokoo,et al. Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.
[19] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[20] Claude E. Shannon,et al. The Mathematical Theory of Communication , 1950 .
[21] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[22] Martin E. Dyer,et al. Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..
[23] Christian Bessiere,et al. Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..
[24] Pedro Meseguer,et al. Distributed Forward Checking , 2003, CP.
[25] Toby Walsh,et al. CSPLIB: A Benchmark Library for Constraints , 1999, CP.
[26] Amnon Meisels,et al. Comparing performance of distributed constraints process ing algorithms , 2002 .
[27] Makoto Yokoo,et al. Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.
[28] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[29] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.