Searching for "Linear-Space Best-First Search." – sorted by Relevance.
-
Effective Use of Memory in Linear Space Best First Search
- Effective use of memory in linear space best first search Marko Robnik- Sikonja 1 Abstract
- Cited by 1 (0 self) – Add To MetaCart
-
Stochastic Node Caching for Memory-bounded Search
- on iterative deepening(Korf 1993). RBFS (Korf 1993) Korf proposed a linear-space best-first search algorithm
- Cited by 13 (1 self) – Add To MetaCart
-
Anytime Heuristic Search: First Results
- that the same technique can be applied to RBFS, a linear-space best-first search algorithm. We have focused
- Cited by 18 (2 self) – Add To MetaCart
-
Eric A. Hansen Shlomo Zilberstein Victor A. Danilchenko
- technique can be applied to RBFS, a linear-space best-first search algorithm. We have focused on converting
- Add To MetaCart
-
Searching with pattern databases
- -time search [8], linear-space best-first search [9]). It is known that determining whether a path of a given
- Cited by 39 (4 self) – Add To MetaCart
-
Limited discrepancy beam search
- to their memory consumption, and linear-space best first search methods [Korf, 1993] have unacceptable runtimes
- Cited by 3 (0 self) – Add To MetaCart
-
Improving Plan Quality and Efficiency using Iterative Deepening
- Linear Space Best First Search In this version of Best First Search, once the children of a node p
- Add To MetaCart
-
Minimax real-time heuristic search
- *, or linear-space best-first search [45, 33], that can consume less memory [33, 5]. Many domains from robotics
- Cited by 9 (1 self) – Add To MetaCart
-
Efficiently Searching the 15-Puzzle
- "good" non-optimal solutions (for example, real-time search [5], linear-space best-first search [6
- Cited by 16 (2 self) – Add To MetaCart

