68 search results - page 8 / 14 » Feature-Discovering Approximate Value Iteration Methods |
NIPS
2007
13 years 9 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
AES
2007
Springer
13 years 7 months ago
2007
Springer
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
SCIA
2009
Springer
14 years 2 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...