1941 search results - page 162 / 389 » On the Hardness of Approximate Reasoning |
238
click to vote
META
1992
15 years 10 months ago
1992
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
161
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
146
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
This study is aimed at investigating whether automatic phonetic transcription procedures can approximate manual transcriptions typically delivered with contemporary large speech c...
151
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
184
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...