No article text was recorded for this version.
incremental node expansion
Version 1 of 131 papers47 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A* with Partial Expansion for Large Branching Factor Problems
- Blog: Enhanced Simplified Memory-bounded A Star (SMA*+)
- Blog: Optimal-Generation Variants of EPEA
- Blog: Monadic constraint programming
- Blog: Information Acquisition in Minimal Window Search
- Blog: Heuristic Search for Large Problems with Real Costs
- Blog: Experimenting with Revisits in Game Tree Search
- Blog: PEA*+IDA*: An Improved Hybrid Memory-Restricted Algorithm
- Blog: Multiple Sequence Alignment Using Anytime A*
- Blog: External Memory Best-First Search for Multiple Sequence Alignment
- Blog: Scaling Up Optimal Heuristic Search in Dec-POMDPs via Incremental Expansion
- Blog: Partial-Expansion A* with Selective Node Generation
- Blog: Grouping Language Model Boundary Words to Speed K-Best Extraction from Hypergraphs
- Blog: Online Stochastic Optimization under Correlated Bandit Feedback
- Blog: Using Introspective Reasoning to Refine Indexing
- Blog: PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA
- Blog: ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm
- Blog: MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs
- Blog: Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding
- Blog: Sparse-Memory Graph Search
- Blog: A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives
- Blog: Fast
- Blog: Large-Scale Parallel Breadth-First Search
- Blog: Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding
- Blog: A Local Monte Carlo Tree Search Approach in Deterministic Planning
- Blog: A*+IDA*: A Simple Hybrid Search Algorithm
- Blog: Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis
- Blog: Avoiding Node Re-Expansions Can Break Symmetry Breaking
- Blog: Edge Partitioning in External-Memory Graph Search
- Blog: Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search
- Blog: Approximate Planning in Large POMDPs via Reusable Trajectories
History & citation
Current · Permanent link
- This direction split from memory-constrained search (58% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_incremental_node_expansion_78b9318b,
title = {incremental node expansion},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/incremental-node-expansion/rdr_78b9318b4490416e8805e370c951b04e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_incremental_node_expansion_78b9318b_v1,
title = {incremental node expansion},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/incremental-node-expansion/rdr_78b9318b4490416e8805e370c951b04e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}