348 search results - page 23 / 70 » Evaluating Temporal Planning Domains |
ISVC
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
AIPS
2006
13 years 9 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
WSC
2001
13 years 9 months ago
2001
Despite the potential, the use of simulation technology at US railroads appears to be lagging behind that in manufacturing and other transportation industries. This paper describe...
FLAIRS
2007
13 years 10 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
VLDB
2005
ACM
14 years 8 months ago
2005
ACM
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...