Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
Communication and Computation in Distributed CSP Algorithms
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
Autonomous Agents and Multi-Agent Systems
Effect of DisCSP variable-ordering heuristics in scale-free networks
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Effect of DisCSP variable-ordering heuristics in scale-free networks
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
Dynamic reordering of variables is known to be important for solving constraint satisfaction problems (CSPs). Efforts to apply this principle for improving polynomial space asynchronous backtracking (ABT) started with [1], using a solution based on synchronization points. [17] shows how to asynchronously enable reordering heuristics in ABT and proposes a general protocol called Asynchronous Backtracking with Reordering (ABTR). In this work we introduce a first framework for modeling heuristics possible with asynchronous backtracking. We also show that ABTR enables heuristics that displace even the agent requesting the reordering, as in the reordering of Dynamic Backtracking. They have not been illustrated in [17]. The most efficient self-reordering heuristic that we introduce and experiment, approx-AWC1, is inspired from AsynchronousWeak-Commitment [21] and brings small but significant improvements, comparable to the results in [1]. We also report that min-domain dynamic ordering heuristics for ABTR are worse than no reordering and better than max-domain (in experiments that also use maintenance of arc consistency).