406 search results - page 3 / 82 » Gadgets, Approximation, and Linear Programming |
109
click to vote
AIPS
2004
15 years 2 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
AIPS
2008
15 years 3 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
117
click to vote
PAMI
2007
15 years 19 days ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
110
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...