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

TitleStatusHype
Toward Efficient Task Assignment and Motion Planning for Large Scale Underwater Mission—0
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments—0
Feature-Based Diversity Optimization for Problem Instance Classification—0
PERCH: Perception via Search for Multi-Object Recognition and Localization—0
Web Search Result Clustering based on Heuristic Search and k-means—0
On the Linear Belief Compression of POMDPs: A re-examination of current methods—0
An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns—0
Grid-based angle-constrained path planning—0
Transition-Based Syntactic Linearization—0
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version—0
Show:102550
← PrevPage 23 of 27Next →

No leaderboard results yet.