914 search results - page 173 / 183 » The Computational Complexity of Probabilistic Planning |
IUI
2004
ACM
14 years 2 months ago
2004
ACM
Complex applications in many areas, including scientific computations and business-related web services, are created from collections of components to form workflows. In many case...
W2GIS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
CHI
2009
ACM
14 years 4 days ago
2009
ACM
We conducted a field-based study examining informal nursing information. We examined the use of this information before and after the adoption of a CPOE (Computerized Provider Ord...
CCCG
2008
13 years 10 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
AI
2008
Springer
13 years 9 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...