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
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data—0
Learning in Real-Time Search: A Unifying Framework—0
Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)—0
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising—0
Learning to Solve Soft-Constrained Vehicle Routing Problems with Lagrangian Relaxation—0
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes—0
Unlocking the Secrets of Software Configuration Landscapes-Ruggedness, Accessibility, Escapability, and Transferability—0
Mean-based Heuristic Search for Real-Time Planning—0
MEMA Runtime Framework: Minimizing External Memory Accesses for TinyML on Microcontrollers—0
RBF-HS: Recursive Best-First Hitting Set Search—0
Show:102550
← PrevPage 19 of 27Next →

No leaderboard results yet.