4843 search results - page 350 / 969 » The Shortcut Problem - Complexity and Approximation |
132
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
118
click to vote
NIPS
2007
15 years 5 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
134
click to vote
WSC
2001
15 years 5 months ago
2001
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...
130
click to vote
DEDS
2010
15 years 4 months ago
2010
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
145
click to vote
IJSNET
2007
15 years 4 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...