On the public citation graph

Effective Heuristics for Suboptimal Best-First Search

0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/springerreference_205502openalex-snapshot
Nonparametric Statistical Inference
inferredcites →https://doi.org/10.1016/0004-3702(70)90007-xopenalex-snapshot
Heuristic search viewed as path finding in a graph
inferredcites →https://doi.org/10.1016/0004-3702(77)90002-9openalex-snapshot
On the complexity of admissible search algorithms
inferredcites →https://doi.org/10.1016/0004-3702(87)90051-8openalex-snapshot
Planning as search: A quantitative approach
inferredcites →https://doi.org/10.1016/0004-3702(93)90045-dopenalex-snapshot
Linear-space best-first search
inferredcites →https://doi.org/10.1016/0020-0190(95)00134-xopenalex-snapshot
A real-time algorithm for the (n2 − 1)-puzzle
inferredcites →https://doi.org/10.1016/0306-4573(85)90100-1openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving.
inferredcites →https://doi.org/10.1016/0377-2217(85)90047-5openalex-snapshot
Heuristics: Intelligent search strategies for computer problem solving
inferredcites →https://doi.org/10.1016/j.artint.2011.02.001openalex-snapshot
Inconsistent heuristics in theory and practice
inferredcites →https://doi.org/10.1016/s0004-3702(01)00092-3openalex-snapshot
Disjoint pattern database heuristics
inferredcites →https://doi.org/10.1016/s0004-3702(01)00094-7openalex-snapshot
Time complexity of iterative-deepening-A∗
inferredcites →https://doi.org/10.1093/biomet/30.1-2.81openalex-snapshot
A NEW MEASURE OF RANK CORRELATION
inferredcites →https://doi.org/10.1098/rspa.1966.0205openalex-snapshot
Experiments with the Graph Traverser program
inferredcites →https://doi.org/10.1109/proc.1981.12145openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1177/0278364909340445openalex-snapshot
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
inferredcites →https://doi.org/10.1609/aaai.v25i1.7819openalex-snapshot
Anytime Nonparametric A*
inferredcites →https://doi.org/10.1609/icaps.v20i1.13412openalex-snapshot
The Joy of Forgetting: Faster Anytime Search via Restarting
inferredcites →https://doi.org/10.1609/icaps.v21i1.13455openalex-snapshot
Potential Search: A Bounded-Cost Search Algorithm
inferredcites →https://doi.org/10.1609/socs.v1i1.18169openalex-snapshot
Portal-Based True-Distance Heuristics for Path Finding
inferredcites →https://doi.org/10.1609/socs.v1i1.18176openalex-snapshot
Landmark Heuristics for the Pancake Problem
inferredcites →https://doi.org/10.1609/socs.v2i1.18198openalex-snapshot
Improved Prediction of IDA*'s Performance via Epsilon-Truncation
inferredcites →https://doi.org/10.1609/socs.v3i1.18242openalex-snapshot
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions
inferredcites →https://doi.org/10.1609/socs.v3i1.18245openalex-snapshot
Implementing Fast Heuristic Search Code
inferredcites →https://doi.org/10.1609/socs.v3i1.18250openalex-snapshot
When Does Weighted A* Fail?
inferredcites →https://doi.org/10.1609/socs.v5i1.18320openalex-snapshot
Speedy Versus Greedy Search
inferredcites →https://doi.org/10.1609/socs.v6i1.18352openalex-snapshot
Building a Heuristic for Greedy Search
inferredcites →https://doi.org/10.1613/jair.2241openalex-snapshot
Compressed Pattern Databases
inferredcites →https://doi.org/10.1613/jair.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.2307/1269084openalex-snapshot
Nonparametric Statistical Inference
inferredcites →https://doi.org/10.2307/2529486openalex-snapshot
Exploratory Data Analysis
inferredcites →https://doi.org/10.2307/2980903openalex-snapshot
Rank Correlation Methods.
inferredcites →https://doi.org/10.2307/3340285openalex-snapshot
Exploratory Data Analysis
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-119openalex-snapshot
Bounded suboptimal search: a direct approach using inadmissible estimates
inferredcites →https://doi.org/10.7551/mitpress/8344.003.0032openalex-snapshot
Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-61659-5_13openalex-snapshot
Transition Graph Analysis of Sliding Tile Puzzle Heuristics
inferred← citeshttps://doi.org/10.1016/j.cja.2026.104235openalex-snapshot
Relaxed planning graph based hybrid heuristic planning method for multi-spacecraft cooperative mission
inferred← citeshttps://doi.org/10.1155/2024/3176356openalex-snapshot
Path Optimization in Robotic Welding of Plate Heat Exchangers: An Improved Ant Colony Approach
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19793openalex-snapshot
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond
inferred← citeshttps://doi.org/10.1609/socs.v18i1.35986openalex-snapshot
Heuristics for Bounded-Suboptimal Search
inferred← citeshttps://doi.org/10.1613/jair.1.13153openalex-snapshot
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
inferred← citeshttps://doi.org/10.2118/195640-msopenalex-snapshot
Efficient Optimization of Well Drilling Sequence with Learned Heuristics
inferred← citeshttps://doi.org/10.2118/195640-paopenalex-snapshot
Efficient Optimization of Well-Drilling Sequence with Learned Heuristics
inferred← citeshttps://doi.org/10.24963/ijcai.2018/199openalex-snapshot
Anytime Focal Search with Applications
inferred← citeshttps://doi.org/10.24963/ijcai.2018/203openalex-snapshot
Best-Case and Worst-Case Behavior of Greedy Best-First Search
inferred← citeshttps://doi.org/10.24963/ijcai.2018/654openalex-snapshot
Local Minima, Heavy Tails, and Search Effort for GBFS
inferred← citeshttps://doi.org/10.24963/ijcai.2019/898openalex-snapshot
Domain-Dependent and Domain-Independent Problem Solving Techniques
inferred← citeshttps://doi.org/10.24963/ijcai.2022/657openalex-snapshot
Learning and Exploiting Progress States in Greedy Best-First Search
inferred← citeshttps://doi.org/10.31605/jcis.v4i2.1203openalex-snapshot
Penerapan Metode Best First Search pada Sistem Informasi Penjualan Online
inferred← citeshttps://doi.org/10.70675/e70b70f9z8381z43a4z806fz68402f3080deopenalex-snapshot
Methods for optimizing the synthesis of quantum circuits
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.