Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
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
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Optimal Distributed Arc-Consistency
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
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)
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Interleaved Backtracking in Distributed Constraint Networks
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
On market-inspired approaches to propositional satisfiability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Protocol/Mechanism Design for Cooperation/Competition
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Solving coarse-grained DisCSPs with local search
Web Intelligence and Agent Systems
Artificial Intelligence Review
| Hi-index | 0.00 |
A distributed constraint satisfaction problem(DisCSP) is a general framework that can formalize various application problems in Multi-Agent Systems. The authors have developed a series of algorithms for solving DisCSPs, including an iterative improvement algorithm called the distributed breakout (DB) algorithm. This algorithm, however, deals only with DisCSPs where each agent has exactly one local variable and the relevant constraints to the variable. In this paper, we propose a new algorithm called Multi-DB for solving distributed SAT (DisSAT) where each agent has multiple local variables and the relevant clauses to the variables. We conduct an experiment to compare Multi-DB with the previous algorithm called Multi-AWC on well-known (Dis)3-SAT benchmarks. The results are very impressive since Multi-DB has much less average communication and computation costs for almost all cases (at least an order of magnitude less for larger problems). We also identify a trade-off between communication and computation costs of algorithms when we vary the degree of decentralization.