Sciweavers

1686 search results - page 33 / 338
» Programs as polygraphs: computability and complexity
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 4 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
ICRA
2005
IEEE
129views Robotics» more  ICRA 2005»
15 years 3 months ago
Dynamic Programming in Reduced Dimensional Spaces: Dynamic Planning For Robust Biped Locomotion
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
Mike Stilman, Christopher G. Atkeson, James Kuffne...
ICALP
1992
Springer
15 years 1 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
PERCOM
2009
ACM
15 years 4 months ago
Opening Pervasive Computing to the Masses Using the SEAP Middleware
— The increasing availability of sensing devices has made the possibility of context-aware pervasive computing applications real. However, constructing this software requires ext...
Seth Holloway, Drew Stovall, Jorge Lara-Garduno, C...
CONTEXT
2003
Springer
15 years 2 months ago
GRAVA: An Architecture Supporting Automatic Context Transitions and Its Application to Robust Computer Vision
We describe a software development approach for vision that enhances robustness by making novel use of context. Conventional approaches to most image understanding problems suffe...
Paul Robertson, Robert Laddaga