Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Artificial Intelligence
Complexity analysis admissible heuristic search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Machine Discovery of Effective Admissible Heuristics
Machine Learning
Searching with Pattern Databases
AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
How to use limited memory in heuristic search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Hierarchical A *: searching abstraction hierarchies efficiently
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Searching for Macro Operators with Automatically Generated Heuristics
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Perspectives on artificial intelligence planning
Eighteenth national conference on Artificial intelligence
Automated Creation of Pattern Database Search Heuristics
Model Checking and Artificial Intelligence
Analyzing the performance of pattern database heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Experiments with multiple abstraction heuristics in symbolic verification
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Efficient memory bound puzzles using pattern databases
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database): h(s) is computed by mapping s to an index and then retrieving the appropriate entry in the table. (Korf 1997) conjectures for search using memory-based heuristics that m 驴 t is a constant, where m is the size of the heuristic's lookup table and t is search time. In this paper we present a method for automatically generating memorybased heuristics and use this to test Korf's conjecture in a large-scale experiment. Our results confirm that there is a direct relationship between m and t.