914 search results - page 85 / 183 » The Computational Complexity of Probabilistic Planning |
213
click to vote
ICAC
2009
IEEE
15 years 6 months ago
2009
IEEE
Increasingly, applications need to be able to self-reconfigure in response to changing requirements and environmental conditions. Autonomic computing has been proposed as a means...
GI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract: Logistics processes in a globalised economy are increasingly complex, dynamic, and distributed. These properties pose major challenges for logistics planning and control....
161
Voted
JPDC
2007
14 years 11 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
WSC
2004
15 years 1 months ago
2004
The authors present the requirement definition and methodological approach for developing a new generation of Computer Generated Forces (CGF) based on Intelligent Agents. The anal...
102
click to vote
AIPS
2008
15 years 2 months ago
2008
We present an automated planning application for generating 3D tasks demonstrations involving a teleoperated robot arm on the International Space Station (ISS). A typical task dem...