Sciweavers

1941 search results - page 70 / 389
» The representation of planning strategies
Sort
View
UAI
2003
13 years 9 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
IJRR
2010
107views more  IJRR 2010»
13 years 6 months ago
Non-parametric Learning to Aid Path Planning over Slopes
— This paper addresses the problem of closing the loop from perception to action selection for unmanned ground vehicles, with a focus on navigating slopes. A new non-parametric l...
Sisir Karumanchi, Thomas Allen, Tim Bailey, Steve ...
SIGMOD
2006
ACM
106views Database» more  SIGMOD 2006»
14 years 7 months ago
Run-time operator state spilling for memory intensive long-running queries
Main memory is a critical resource when processing longrunning queries over data streams with state intensive operators. In this work, we investigate state spill strategies that h...
Bin Liu, Yali Zhu, Elke A. Rundensteiner
FOCS
2007
IEEE
14 years 2 months ago
Planning for Fast Connectivity Updates
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
Mihai Patrascu, Mikkel Thorup
APIN
2004
81views more  APIN 2004»
13 years 7 months ago
Learning Generalized Policies from Planning Examples Using Concept Languages
In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the probl...
Mario Martin, Hector Geffner