A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Constraint Processing
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
MDPOP: faithful distributed implementation of efficient social choice problems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Caching schemes for DCOP search algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
Analyzing the performance of distributed algorithms
PerMIS '07 Proceedings of the 2007 Workshop on Performance Metrics for Intelligent Systems
Improving DPOP with function filtering
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Balancing local resources and global goals in multiply-constrained DCOP
Multiagent and Grid Systems
Bounded approximate decentralised coordination via the max-sum algorithm
Artificial Intelligence
A study for representations of distributed cooperative search algorithms based on pseudo-trees
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Distributed constraint optimization with MULBS: A case study on collaborative meeting scheduling
Journal of Network and Computer Applications
Stochastic dominance in stochastic DCOPs for risk-sensitive applications
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Hi-index | 0.00 |
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating low communication overheads. However, DPOP's memory requirements are exponential in the induced width of the constraint graph, which may be prohibitive for problems with large width. We present MB-DPOP, a new hybrid algorithm that can operate with bounded memory. In areas of low width, MB-DPOP operates like standard DPOP (linear number of messages). Areas of high width are explored with bounded propagations using the idea of cycle-cuts [Dechter, 2003]. We introduce novel DFS-based mechanisms for determining the cycle-cutset, and for grouping cycle-cut nodes into clusters. We use caching ([Darwiche, 2001]) between clusters to reduce the complexity to exponential in the largest number of cycle cuts in a single cluster. We compare MB-DPOP with ADOPT [Modi et al., 2005], the current state of the art in distributed search with bounded memory. MB-DPOP consistently outperforms ADOPT on 3 problem domains, with respect to 3 metrics, providing speedups of up to 5 orders of magnitude.