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 171–180 of 261 papers

TitleStatusHype
Improved Safe Real-time Heuristic Search—0
Improving Learnt Local MAPF Policies with Heuristic Search—0
Inconsistency and Accuracy of Heuristics with A* Search—0
Induction, of and by Probability—0
Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters—0
Inductive Bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters—0
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version—0
Interactive Ant Colony Optimisation (iACO) for Early Lifecycle Software Design—0
Iterative Budgeted Exponential Search—0
LaMMA-P: Generalizable Multi-Agent Long-Horizon Task Allocation and Planning with LM-Driven PDDL Planner—0
Show:102550
← PrevPage 18 of 27Next →

No leaderboard results yet.