7129 search results - page 351 / 1426 » Approximation Algorithms for Treewidth |
150
Voted
ALGOSENSORS
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
120
click to vote
ICSM
2002
IEEE
15 years 9 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...
154
click to vote
KR
2004
Springer
15 years 10 months 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...
120
click to vote
IJAR
2006
15 years 4 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...
143
click to vote
ML
2002
ACM
15 years 4 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...