3049 search results - page 36 / 610 » On the Convergence of Bound Optimization Algorithms |
107
click to vote
ICALP
1995
Springer
15 years 5 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
187
click to vote
CP
2011
Springer
14 years 1 months ago
2011
Springer
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...
133
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
124
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
130
click to vote
IJCAI
2007
15 years 3 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...