7930 search results - page 464 / 1586 » Greedy in Approximation Algorithms |
151
click to vote
ICSM
2002
IEEE
15 years 12 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...
191
click to vote
KR
2004
Springer
16 years 8 days ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
164
click to vote
IJAR
2006
15 years 7 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
183
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
199
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...