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 251–261 of 261 papers

TitleStatusHype
Inconsistency and Accuracy of Heuristics with A* Search—0
Defeasible Decisions: What the Proposal is and isn't—0
Ideal Reformulation of Belief Networks—0
Heuristic Search as Evidential Reasoning—0
Induction, of and by Probability—0
The Optimality of Satisficing Solutions—0
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data—0
Interactive Ant Colony Optimisation (iACO) for Early Lifecycle Software Design—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
Learning in Real-Time Search: A Unifying Framework—0
Theoretical Analysis of Heuristic Search Methods for Online POMDPs—0
Show:102550
← PrevPage 6 of 6Next →

No leaderboard results yet.