Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Low overhead alternatives to SSS*
Artificial Intelligence
Optimal path-finding algorithms*
Search in Artificial Intelligence
The History Heuristic and Alpha-Beta Search Enhancements in Practice
IEEE Transactions on Pattern Analysis and Machine Intelligence
Heuristic search in restricted memory (research note)
Artificial Intelligence
Single-Agent Parallel Window Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Artificial Intelligence
An efficient iterative threshold heuristic tree search algorithm
An efficient iterative threshold heuristic tree search algorithm
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
Encyclopedia of Artificial Intelligence
Encyclopedia of Artificial Intelligence
An Introduction to Automated Deduction
Fundamentals of Artificial Intelligence: An Advanced Course, held in Vignieu, France, July 1985
The principal continuation and the killer heuristic
ACM '77 Proceedings of the 1977 annual conference
Transposition table driven work scheduling in distributed search
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
IEEE Transactions on Parallel and Distributed Systems
Directed Automated Theorem Proving
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Unifying Single-Agent and Two-Player Search
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Creating Difficult Instances of the Post Correspondence Problem
CG '00 Revised Papers from the Second International Conference on Computers and Games
Error Detection with Directed Symbolic Model Checking
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Finding Optimal Solutions to Atomix
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in 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
Average-case analysis of best-first search in two representative directed acyclic graphs
Artificial Intelligence
Performance evaluation of parallel iterative deepening A* on clusters of workstations
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Breadth-first heuristic search
Artificial Intelligence
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
GP-rush: using genetic programming to evolve solvers for the rush hour puzzle
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Transposition tables for constraint satisfaction
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Simulation-based approach to general game playing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Bidirectional heuristic search reconsidered
Journal of Artificial Intelligence Research
Switching from bidirectional to unidirectional search
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
How to use limited memory in heuristic search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Comparison of different grid abstractions for pathfinding on maps
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Breadth-first heuristic search
Artificial Intelligence
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Exploiting graph properties of game trees
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Dynamic improvements of heuristic evaluations during search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
GA-FreeCell: evolving solvers for the game of FreeCell
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A comparison of multiobjective depth-first algorithms
Journal of Intelligent Manufacturing
Hi-index | 0.14 |
Iterative-deepening searches mimic a breadth-first node expansion with a series of depth-first searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of best-first searches like A* from exponential to linear in the search depth. But there is more to iterative-deepening than just a reduction of storage space. As the authors show, the search efficiency can be greatly improved by exploiting previously gained node information. The information management techniques considered here owe much to their counterparts from the domain of two-player games, namely the use of fast-execution memory functions to guide the search. The authors' methods not only save node expansions, but are also faster and easier to implement than previous proposals.