3874 search results - page 218 / 775 » Approximation Algorithms for k-hurdle Problems |
144
click to vote
JAIR
2006
15 years 3 months ago
2006
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
114
click to vote
TALG
2010
15 years 2 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
136
click to vote
MP
2006
15 years 3 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
143
click to vote
ICML
2001
IEEE
16 years 4 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
138
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...