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
Factored World Models for Zero-Shot Generalization in Robotic ManipulationCode0
Heuristic Search for Rank Aggregation with Application to Label Ranking—0
Unlocking the Secrets of Software Configuration Landscapes-Ruggedness, Accessibility, Escapability, and Transferability—0
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning—0
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies—0
A Novel Sleep Stage Classification Using CNN Generated by an Efficient Neural Architecture Search with a New Data Processing Trick—0
HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties—0
Ecological landscapes guide the assembly of optimal microbial communities—0
Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams—0
Searching for More Efficient Dynamic Programs—0
Show:102550
← PrevPage 13 of 27Next →

No leaderboard results yet.