481 search results - page 5 / 97 » Anytime Local Search for Distributed Constraint Optimization |
113
Voted
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
AAAI
2006
15 years 1 months ago
2006
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...
93
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
104
Voted
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
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...