Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
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
Consistency Maintenance for ABT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Effect of Nogood Learning in Distributed Constraint Satisfaction
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Connecting ABT with Arc Consistency
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
The Effects of Agent Synchronization in Asynchronous Search Algorithms
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Improving ABT Performance by Adding Synchronization Points
Recent Advances in Constraints
Concurrent search for distributed CSPs
Artificial Intelligence
Min-domain ordering for asynchronous backtracking
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Distributed forward checking may lie for privacy
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Asynchronous inter-level forward-checking for DisCSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Implementation and evaluation methodology for the asynchronous search techniques in DisCSP-NetLogo
WSEAS Transactions on Information Science and Applications
The evaluation of the asynchronous search techniques in DisCSP-NetLogo
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
The effect of synchronization of agents' execution in randomly generated networks of constraints
ECC'11 Proceedings of the 5th European conference on European computing conference
Boosting distributed constraint satisfaction
Journal of Heuristics
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
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
Finding a nash equilibrium by asynchronous backtracking
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
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 |
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constraint networks. They differ in the way they store nogoods, but they all use additional communication links between unconnected agents to detect obsolete information. In this paper, we propose a new asynchronous backtracking algorithm which does not need to add links between initially unconnected agents. To make the description simpler and to facilitate the comparisons between algorithms, we present a unifying framework from which the new algorithm we propose, as well as existing ones, are derived. We provide an experimental evaluation of these algorithms.