SOTAVerified

Heuristic Search

Heuristic Search is a problem-solving method that uses practical rules or "guides" (heuristics) to find solutions more quickly than exhaustive search, by focusing on the most promising paths first.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 181–190 of 261 papers

TitleStatusHype
Windowed MAPF with Completeness Guarantees—0
"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming—0
A*+BFHS: A Hybrid Heuristic Search Algorithm—0
Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees—0
A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem—0
Abstract Interpretation for Generalized Heuristic Search in Model-Based Planning—0
Action Selection for MDPs: Anytime AO* vs. UCT—0
A Formal Characterization of the Local Search Topology of the Gap Heuristic—0
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks—0
A Heuristic Search Algorithm for Solving First-Order MDPs—0
Show:102550
← PrevPage 19 of 27Next →

No leaderboard results yet.