Sciweavers

312 search results - page 2 / 63
» On k-optimal distributed constraint optimization algorithms:...
Sort
View
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
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
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ECAI
2008
Springer
13 years 6 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
ICASSP
2009
IEEE
13 years 11 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...