Memory-bounded Search
Memory-Bounded Search is a heuristic search strategy that belongs to the class of informed search algorithms, distinguished by its explicit constraint on memory usage during node expansion, typically employing mechanisms to discard or summarize less promising paths when memory limits are reached.
81
Publications
12.9K
Citations
196
Authors
113
Institutions
Publications per year
2017–2026
14
Parents
81
Fred Glover · INFORMS Journal on Applied Analytics · 1990 · 1.1K citations
Finding optimal solutions to Rubik's cube using pattern databases
Richard E. Korf · 1997 · 255 citations
1–5 of 81
196
5
h-index
5
h-index
4
h-index
3
h-index
3
h-index
1–5 of 196
113

University of Alberta
Edmonton, Canada
6 h-index
12 publications
1.1K citations
Ben-Gurion University of the Negev
Beersheba, Israel
5 h-index
14 publications
1.3K citations
University of California, Irvine
Irvine, United States
5 h-index
10 publications
212 citations

Université du Québec en Outaouais
Gatineau, Canada
4 h-index
5 publications
152 citations
University of Southern California
Los Angeles, United States
3 h-index
6 publications
303 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
45 citations
University of Denver
Denver, United States
3 h-index
9 publications
1.1K citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
5 publications
599 citations
1–8 of 113
Conference · 3 publications · 247 citations
3
h-index
JAIR · 3 publications · 228 citations
3
h-index
2 publications · 33 citations
2
h-index
TKDE · 2 publications · 56 citations
2
h-index
2 publications · 26 citations
2
h-index
1–5