Sciweavers

782 search results - page 1 / 157
» MB-DPOP: A New Memory-Bounded Algorithm for Distributed Opti...
Sort
View
IJCAI
2007
13 years 6 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
ATAL
2008
Springer
13 years 7 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
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...
AAAI
2006
13 years 6 months ago
Locally Optimal Algorithms and Solutions for Distributed Constraint Optimization
This paper summarizes the author's recent work in distributed constraint optimization (DCOP). New local algorithms, as well as theoretical results about the types of solution...
Jonathan P. Pearce
EMMCVPR
2001
Springer
13 years 9 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...