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

TitleStatusHype
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?—0
A Heuristic Search Algorithm for Solving First-Order MDPs—0
Generating Acrostics via Paraphrasing and Heuristic Search—0
Cascading A*: a Parallel Approach to Approximate Heuristic Search—0
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes—0
Homotopy based algorithms for _0-regularized least-squares—0
COLIN: Planning with Continuous Linear Numeric Change—0
Avoiding and Escaping Depressions in Real-Time Heuristic Search—0
On-line Planning and Scheduling: An Application to Controlling Modular Printers—0
Best-First Heuristic Search for Multicore Machines—0
Show:102550
← PrevPage 24 of 27Next →

No leaderboard results yet.