Sciweavers

8 search results - page 1 / 2
» Generalizing DPOP: Action-GDL, a new complete algorithm for ...
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...
Meritxell Vinyals, Juan A. Rodríguez-Aguila...
ATAL
2007
Springer
13 years 11 months ago
SSDPOP: improving the privacy of DCOP with secret sharing
Multi-agent systems designed to work collaboratively with groups of people typically require private information that people will entrust to them only if they have assurance that ...
Rachel Greenstadt, Barbara J. Grosz, Michael D. Sm...
ATAL
2007
Springer
13 years 11 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
ATAL
2006
Springer
13 years 8 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ATAL
2008
Springer
13 years 7 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...