Sciweavers

62 search results - page 1 / 13
» Asynchronous algorithms for approximate distributed constrai...
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
AI
2005
Springer
13 years 4 months ago
Adopt: asynchronous distributed constraint optimization with quality guarantees
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
FUIN
2010
143views more  FUIN 2010»
13 years 2 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
ECAI
2006
Springer
13 years 8 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
CP
2011
Springer
12 years 4 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...