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
ASNets: Deep Learning for Generalised PlanningCode0
Iterative Budgeted Exponential Search—0
Automatic Generation of Atomic Consistency Preserving Search Operators for Search-Based Model Engineering—0
AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Rates—0
Heuristic Authorship ObfuscationCode0
Hybrid Planning for Dynamic Multimodal Stochastic Shortest PathsCode0
Direct Policy Gradients: Direct Optimization of Policies in Discrete Action Spaces—0
Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees—0
Exponential-Binary State-Space Search—0
Optimal Decision Making Under Strategic BehaviorCode1
Show:102550
← PrevPage 19 of 27Next →

No leaderboard results yet.