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 41–50 of 261 papers

TitleStatusHype
Compiler-Level Matrix Multiplication Optimization for Deep Learning—0
Consolidating LAMA with Best-First Width Search—0
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning—0
A Neural Architecture Search based Framework for Liquid State Machine Design—0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?—0
Best-First Heuristic Search for Multicore Machines—0
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains—0
Cascading A*: a Parallel Approach to Approximate Heuristic Search—0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding—0
Action Selection for MDPs: Anytime AO* vs. UCT—0
Show:102550
← PrevPage 5 of 27Next →

No leaderboard results yet.