No article text was recorded for this version.
memory-constrained search
Version 2 of 2517 papers675 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The Compressed Differential Heuristic
- Blog: Frontier search
- Blog: Making Best Use of Available Memory When Searching Game Trees
- Blog: ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm
- Blog: Finding Heavy Paths in Graphs: A Rank Join Approach
- Blog: Enhanced Simplified Memory-bounded A Star (SMA*+)
- Blog: Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory
- Blog: Frontier Search and Plan Reconstruction in Oversubscription Planning
- Blog: Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
- Blog: Cost-Optimal External Planning
- Blog: External-Memory Pattern Databases Using Structured Duplicate Detection
- Blog: A Space-Time Tradeoff for Memory-Based Heuristics
- Blog: Performance of IDA on Trees and Graphs
- Blog: Relative Efficiency of Alpha-Beta Implementations
- Blog: Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
- Blog: Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
- Blog: A* Lasso for Learning a Sparse Bayesian Network Structure for Continuous Variables
- Blog: A Divide and Conquer Bidirectional Search: First Results
- Blog: Sparse-Memory Graph Search
- Blog: 09491 Abstracts Collection - Graph Search Engineering
- Blog: Information Acquisition in Minimal Window Search
- Blog: Best-First Frontier Search with Delayed Duplicate Detection
- Blog: A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results
- Blog: Compressing Pattern Databases
- Blog: Duplicate Avoidance in Depth-First Search with Applications to Treewidth
- Blog: An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices
- Blog: Lazy Model Expansion: Interleaving Grounding with Search
- Blog: Space-Efficient Parallel Algorithms for Combinatorial Search Problems
- Blog: Space-efficient parallel algorithms for combinatorial search problems
- Blog: Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement
- Blog: A Breadth-First Approach to Memory-Efficient Graph Search
- Blog: The Compressed Differential Heuristic
- Blog: Search Algorithms for m Best Solutions for Graphical Models
- Blog: Enhanced Multi-Objective A* with Partial Expansion
- Blog: Using Aspiration Windows for Minimax Algorithms
- Blog: Blossom: an Anytime Algorithm for Computing Optimal Decision Trees
- Blog: Best-First AND/OR Search for Graphical Models
- Blog: External Memory Best-First Search for Multiple Sequence Alignment
- Blog: Minimizing Disk I/O in Two-Bit Breadth-First Search
- Blog: Consolidating LAMA with Best-First Width Search
- Blog: A Survey of Parallel A
- Blog: Structured Duplicate Detection in External-Memory Graph Search
- Blog: Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities
- Blog: Bidirectional Best-First Search with Bounded Error: Summary of Results
- Blog: Pruning Duplicate Nodes in Depth-First Search
- Blog: Exploiting Algebraic Structure in Parallel State Space Search
- Blog: Switching from Bidirectional to Unidirectional Search
- Blog: To Store or Not to Store
- Blog: Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP
- Blog: LiteEFG: An Efficient Python Library for Solving Extensive-form Games
- Blog: Soft and Cost MDD Propagators
- Blog: Memory Bounded Open-Loop Planning in Large POMDPs using Thompson Sampling
- Blog: Using Caching to Solve Larger Probabilistic Planning Problems
- Blog: Memory Bounded Open-Loop Planning in Large POMDPs Using Thompson Sampling.
- Blog: Randomized Greedy Sampling for JSSP
- Blog: Parallelizing Maximal Clique Enumeration on GPUs
- Blog: Incremental Clustering and Expansion for Faster Optimal Planning in Dec-POMDPs
- Blog: Depth-First vs. Best-First Search: New Results
- Blog: Branches: Efficiently Seeking Optimal Sparse Decision Trees with AO*
- Blog: A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding
Showing 60 of 517 papers.
History & citation
Current · Permanent link
- Memory-Bounded Hybrid Search Strategies merged into this direction (68% overlap)
- External Memory Search for Massive State Spaces merged into this direction (87% overlap)
- Partial Expansion for High Branching Factor Search merged into this direction (52% overlap)
- delayed duplicate detection split from this direction (77% overlap)
- disk I/O bottleneck split from this direction (52% overlap)
- incremental node expansion split from this direction (58% overlap)
- recursive best-first search split from this direction (64% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_memory_constrained_search_e0dab7a9,
title = {memory-constrained search},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/memory-constrained-search/rdr_e0dab7a9de9f4e51b81dab96ea3f95ef},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_memory_constrained_search_e0dab7a9_v2,
title = {memory-constrained search},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/memory-constrained-search/rdr_e0dab7a9de9f4e51b81dab96ea3f95ef/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}