No article text was recorded for this version.
recursive best-first search
Version 1 of 111 papers18 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fast
- Blog: AND/OR Search for Marginal MAP
- Blog: From Exact to Anytime Solutions for Marginal MAP
- Blog: Pushing Forward Marginal MAP with Best-First Search
- Blog: Making Best Use of Available Memory When Searching Game Trees
- Blog: HUGE: An Efficient and Scalable Subgraph Enumeration System
- Blog: Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP
- Blog: Anytime Recursive Best-First Search for Bounding Marginal MAP
- Blog: How to Use Limited Memory in Heuristic Search
- Blog: Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory
- Blog: Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models
History & citation
Current · Permanent link
- This direction split from MAP inference complexity (55% overlap)
- This direction split from memory-constrained search (64% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_recursive_best_first_search_a4436659,
title = {recursive best-first search},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/recursive-best-first-search/rdr_a4436659520a4afaadcf72275ef42d92},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_recursive_best_first_search_a4436659_v1,
title = {recursive best-first search},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/recursive-best-first-search/rdr_a4436659520a4afaadcf72275ef42d92/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}