Sciweavers

455 search results - page 87 / 91
» Approximation Algorithms for Partial Covering Problems
Sort
View
CORR
2010
Springer
204views Education» more  CORR 2010»
14 years 8 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon
ATAL
2008
Springer
14 years 11 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 1 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
85
Voted
COMPGEOM
2010
ACM
15 years 1 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
SCALESPACE
2007
Springer
15 years 3 months ago
Faithful Recovery of Vector Valued Functions from Incomplete Data
On March 11, 1944, the famous Eremitani Church in Padua (Italy) was destroyed in an Allied bombing along with the inestimable frescoes by Andrea Mantegna et al. contained in the Ov...
Massimo Fornasier