402 search results - page 6 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
ATAL
2005
Springer
14 years 1 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...
WDAG
2009
Springer
14 years 2 days 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...
ICNSC
2007
IEEE
14 years 1 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...
ICRA
2006
IEEE
14 years 1 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...
EUROCAST
2009
Springer
14 years 2 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...