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

TitleStatusHype
AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Rates—0
Avoiding and Escaping Depressions in Real-Time Heuristic Search—0
Bayesian Decision Trees via Tractable Priors and Probabilistic Context-Free Grammars—0
Beam Search: Faster and Monotonic—0
Best-First Heuristic Search for Multicore Machines—0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?—0
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning—0
Can Large Language Models Play Games? A Case Study of A Self-Play Approach—0
Cascading A*: a Parallel Approach to Approximate Heuristic Search—0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding—0
Show:102550
← PrevPage 22 of 27Next →

No leaderboard results yet.