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 121–130 of 261 papers

TitleStatusHype
Dense Crowd Flow-Informed Path Planning—0
Heuristics for vehicle routing problems: Sequence or set optimization?—0
A Multi-Heuristic Search-based Motion Planning for Automated Parking—0
A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem—0
Improving Learnt Local MAPF Policies with Heuristic Search—0
HSVI can solve zero-sum Partially Observable Stochastic Games—0
Defeasible Decisions: What the Proposal is and isn't—0
Asynchronously Trained Distributed Topographic Maps—0
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks—0
Ideal Reformulation of Belief Networks—0
Show:102550
← PrevPage 13 of 27Next →

No leaderboard results yet.