402 search results - page 6 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
167
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
139
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
158
Voted
ICNSC
2007
IEEE
15 years 10 months ago
2007
IEEE
The paper addresses object localization via a distributed sensor network. A centralized estimation approach is undertaken along with a selective node activation strategy to ensure...
110
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper addresses the consistency issue of the Extended Kalman Filter approach to the simultaneous localization and mapping (EKF-SLAM) problem. Linearization of the inherent...
130
Voted
EUROCAST
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...