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 131–140 of 261 papers

TitleStatusHype
The αμ Search Algorithm for the Game of Bridge—0
Topological Value Iteration Algorithms—0
Toward Efficient Task Assignment and Motion Planning for Large Scale Underwater Mission—0
Transition-Based Syntactic Linearization—0
Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints—0
Universal Policies for Software-Defined MDPs—0
Voxel selection framework based on meta-heuristic search and mutual information for brain decoding—0
Web Search Result Clustering based on Heuristic Search and k-means—0
Windowed MAPF with Completeness Guarantees—0
"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming—0
Show:102550
← PrevPage 14 of 27Next →

No leaderboard results yet.