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

TitleStatusHype
Heuristic Search for Rank Aggregation with Application to Label Ranking—0
Heuristic Search for Structural Constraints in Data Association—0
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning—0
Heuristics for vehicle routing problems: Sequence or set optimization?—0
Homotopy based algorithms for _0-regularized least-squares—0
HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms—0
HSVI can solve zero-sum Partially Observable Stochastic Games—0
HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties—0
Ideal Reformulation of Belief Networks—0
Implicit Abstraction Heuristics—0
Show:102550
← PrevPage 17 of 27Next →

No leaderboard results yet.