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
Fanoos: Multi-Resolution, Multi-Strength, Interactive Explanations for Learned SystemsCode0
On Parallel External-Memory Bidirectional SearchCode0
Fast threshold optimization for multi-label audio tagging using Surrogate gradient learningCode0
A Novel Point-based Algorithm for Multi-agent Control Using the Common Information ApproachCode0
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)Code0
Counterfactual Explanation Algorithms for Behavioral and Textual DataCode0
Finding Optimal Diverse Feature Sets with Alternative Feature SelectionCode0
Learning Heuristic Selection with Dynamic Algorithm ConfigurationCode0
Factored World Models for Zero-Shot Generalization in Robotic ManipulationCode0
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node ExpansionsCode0
Show:102550
← PrevPage 22 of 27Next →

No leaderboard results yet.