Linear-time disk-based implicit graph search
From MaRDI portal
Recommendations
Cited in
(8)- A framework for analysing state-abstraction methods
- Predicting optimal solution cost with conditional probabilities
- Coloring Hanoi and Sierpiński graphs
- Theory and practice of time-space trade-offs in memory limited search
- Finding optimal solutions to Atomix
- KI 2004: Advances in Artificial Intelligence
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
This page was built for publication: Linear-time disk-based implicit graph search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452192)