914 search results - page 132 / 183 » The Computational Complexity of Probabilistic Planning |
SASO
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— On the one hand, natural phenomena of spontaneous pattern formation are generally random and repetitive, whereas, on the other hand, complicated heterogeneous architect...
PG
2007
IEEE
14 years 3 months ago
2007
IEEE
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
AGI
2008
13 years 10 months ago
2008
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
NIPS
2007
13 years 10 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...