92 search results - page 6 / 19 » New Heuristics for Timeline-Based Planning |
149
Voted
ESWS
2011
Springer
2011
Springer
Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution
14 years 4 months ago
Abstract. Link traversal based query execution is a new query execution paradigm for the Web of Data. This approach allows the execution engine to discover potentially relevant dat...
122
Voted
AI
2010
Springer
15 years 28 days ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
141
Voted
AAAI
2012
13 years 3 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
128
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
101
Voted
AIPS
2010
15 years 1 months ago
2010
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-states. We de...