Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Three approaches to heuristic search in networks
Journal of the ACM (JACM)
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Heuristic search in restricted memory (research note)
Artificial Intelligence
Stochastic node caching for memory-bounded search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Linear-space best-first search: summary of results
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Performance of IDA on trees and graphs
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Pruning duplicate nodes in depth-first search
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Dynamic improvements of heuristic evaluations during search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Improving search efficiency using possible subgoals
Mathematical and Computer Modelling: An International Journal
Forward perimeter search with controlled use of memory
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
MREC is a new recursive best-first search algorithm which combines the good features of A* and IDA*. It is closer in operation to IDA*, and does not use an OPEN list. In order to execute, all MREC needs is sufficient memory for its implicit stack. But it can also be fed at runtime a parameter M which tells it how much additional memory is available for use. In this extra memory, MREC stores as much as possible of the explicit graph. When M = 0, MREC is identical to IDA*. But when M 0, it can make far fewer node expansions than IDA*. This can be advantageous for problems where the time to expand a node is significant. Extensive runs on a variety of search problems, involving search graphs that may or may not be trees, indicate that MREC with M = 0 is as good as IDA* on problems such as the 15- puzzle for which IDA* is suitable, while MREC with large M is as fast as A* on problems for which node expansion time is not negligible.