408 search results - page 38 / 82 » A lookahead strategy for solving large planning problems |
AAAI
2000
14 years 11 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
164
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
JAIR
2006
14 years 9 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
ASPDAC
2006
ACM
15 years 3 months ago
2006
ACM
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...