No article text was recorded for this version.
heuristic computation overhead
Version 2 of 2473 papers627 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm
- Blog: A Result on the Computational Complexity of
- Blog: Towards a Better Understanding of Bidirectional Search
- Blog: Further Improved Heuristics For Conflict-Based Search
- Blog: Abstraction Heuristics for Symbolic Bidirectional Search
- Blog: A Linear Programming Heuristic for Optimal Planning
- Blog: Solving a Rubik's Cube Using its Local Graph Structure
- Blog: Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results
- Blog: Using A* for Inference in Probabilistic Classifier Chains
- Blog: Figures of Merit for Best-First Probabilistic Chart Parsing
- Blog: Rational Deployment of CSP Heuristics
- Blog: To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
- Blog: Heuristic Subset Selection in Classical Planning
- Blog: Invited Speakers
- Blog: A Theoretical and Experimental Comparison of Constraint Propagation
- Blog: The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation
- Blog: Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding
- Blog: Finding Optimal Solutions to the Twenty-Four Puzzle
- Blog: On Creating Complementary Pattern Databases
- Blog: Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner
- Blog: Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search
- Blog: Counting-Based Search for Constraint Optimization Problems
- Blog: Conflict-driven ASP Solving with External Sources
- Blog: Effective Planning with More Expressive Languages
- Blog: A Rearrangement Search Strategy for Determining Propositional Satisfiability
- Blog: Towards Rational Deployment of Multiple Heuristics in A*
- Blog: Learning and Exploiting Progress States in Greedy Best-First Search
- Blog: Optimal Planning with Axioms
- Blog: On some improvements to Unbounded Minimax
- Blog: Hierarchical A* Parsing with Bridge Outside Scores
- Blog: SCOTT: A Model-Guided Theorem Prover
- Blog: Using Domain Knowledge to Improve Monte-Carlo Tree Search Performance in Parameterized Poker Squares
- Blog: Saturated Cost Partitioning for Optimal Classical Planning
- Blog: On Producing Shortest Cost-Optimal Plans
- Blog: Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics
- Blog: Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT
- Blog: Semi-Relaxed Plan Heuristics
- Blog: Learning A* underestimates: Using inference to guide inference
- Blog: An Algorithm Better than AO*?
- Blog: Multi-Dimensional Heuristic Searching
- Blog: Heuristic planning for PDDL+ domains
- Blog: Heuristics for Cost-Optimal Classical Planning Based on Linear Programming
- Blog: Determining Solvability in the Birds of a Feather Card Game
- Blog: Incorporating Opponent Models into Adversary Search
- Blog: Strengthening Canonical Pattern Databases with Structural Symmetries
- Blog: Branch and Bound with Mini-Bucket Heuristics
- Blog: Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends
- Blog: Semantically Guiding a First-Order Theorem Prover with a Soft Model
- Blog: Accelerating data-driven algorithm selection for combinatorial partitioning problems
- Blog: F-Cardinal Conflicts in Conflict-Based Search
- Blog: A* Search and Bound-Sensitive Heuristics for Oversubscription Planning
- Blog: Beyond Pairwise Reasoning in Multi-Agent Path Finding
- Blog: The Power of Literal Equivalence in Model Counting
- Blog: AND/OR Search for Marginal MAP
- Blog: Constrained Heuristic Search
- Blog: The Markgraf Karl Refutation Procedure
- Blog: Machine Discovery of Effective Admissible Heuristics
- Blog: The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators
- Blog: Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
- Blog: An Improved Di-Directional Heuristic Search Algorithm
Showing 60 of 473 papers.
History & citation
Current · Permanent link
- The Efficiency Tradeoff in Systematic Search merged into this direction (54% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_heuristic_computation_overhead_69844f66,
title = {heuristic computation overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/heuristic-computation-overhead/rdr_69844f664219438fb05442e107710067},
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_heuristic_computation_overhead_69844f66_v2,
title = {heuristic computation overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/heuristic-computation-overhead/rdr_69844f664219438fb05442e107710067/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}