Efficient memory-bounded search methods (1992) [43 citations — 0 self]
by Stuart Russell
In ECAI-92
http://www.cs.berkeley.edu/~russell/papers/ecai92-sma.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Russell92efficientmemory-bounded,author = {Stuart Russell},
title = {Efficient memory-bounded search methods},
booktitle = {In ECAI-92},
year = {1992},
pages = {1--5},
publisher = {Wiley}
}
Years of Citing Articles
Abstract:
Abstract. Memory-bounded algorithms such as
Citations
| 459 | A Formal Basis for the Heuristic Determination of Minimum Cost Paths – Hart, Nilsson, et al. - 1968 |
| 182 | Depth-first iterative deepening: an optimal admissible tree search,”Artificial Intelligence 27(1 – Korf - 1985 |
| 33 | Prolog Programming for – Bratko - 1986 |
| 27 | Heuristic search in restricted memory – Chakrabati, Ghose, et al. - 1989 |
| 6 | Generalized best-first strategies and the optimality of A – Dechter, Pearl - 1985 |
| 3 | Estimating the value of computation: The case of real-time search – Wefald, Russell - 1989 |
| 2 | Experiments with the graph traverser – Doran, Michie - 1966 |
| 1 | Best-first search with limited memory – Korf - 1991 |
