On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Chaotic iteration for distributed constraint propagation
Proceedings of the 1999 ACM symposium on Applied computing
Determining the usefulness of information from its use during problem solving
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Asynchronous Search for Numeric DisCSPs
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Exploiting interchangeabilities in constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the feasibility of distributed constraint satisfaction
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Arc-consistency in dynamic constraint satisfaction problems
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
An efficient cross product representation of the constraint satisfaction problem search space
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Parallel and distributed algorithms for finite constraint satisfaction problems
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
Connecting ABT with Arc Consistency
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Min-domain ordering for asynchronous backtracking
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Asynchronous inter-level forward-checking for DisCSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Comparison of tightly and loosely coupled decision paradigms in multiagent expedition
International Journal of Approximate Reasoning
Boosting distributed constraint satisfaction
Journal of Heuristics
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly, many of these tasks pose themselves in a distributed setting where variables and constraints are distributed among different agents. A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains.