Sciweavers

1191 search results - page 1 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
JAIR
2008
110views more  JAIR 2008»
13 years 4 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
IAT
2007
IEEE
13 years 11 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
ATAL
2005
Springer
13 years 10 months ago
Impact of problem centralization in distributed constraint optimization algorithms
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
John Davin, Pragnesh Jay Modi
JAIR
2006
131views more  JAIR 2006»
13 years 4 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
ATAL
2004
Springer
13 years 10 months ago
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
Roger Mailler, Victor R. Lesser