72 search results - page 11 / 15 » Fast Planning by Search in Domain Transition Graph |
AIPS
2007
15 years 1 months ago
2007
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
AIPS
2008
15 years 1 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
AIPS
2000
15 years 29 days ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
89
Voted
INTERNET
2007
14 years 11 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...
103
click to vote
FQAS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The task of similarity search is widely used in various areas of computing, including multimedia databases, data mining, bioinformatics, social networks, etc. For a long ...