79 search results - page 5 / 16 » A Dynamic Programming Framework for Combinatorial Optimizati... |
191
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
105
click to vote
AAAI
1998
15 years 3 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
103
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
113
click to vote
CP
2005
Springer
15 years 8 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...
114
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...