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
HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties—0
Ecological landscapes guide the assembly of optimal microbial communities—0
AMRA*: Anytime Multi-Resolution Multi-Heuristic A*Code1
Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams—0
Searching for More Efficient Dynamic Programs—0
Voxel selection framework based on meta-heuristic search and mutual information for brain decoding—0
A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls—0
MASAI: Multi-agent Summative Assessment Improvement for Unsupervised Environment DesignCode0
Similarity Downselection: A Python implementation of a heuristic search algorithm for finding the set of the n most dissimilar items with an application in conformer samplingCode0
Generalized Planning as Heuristic Search—0
Show:102550
← PrevPage 13 of 27Next →

No leaderboard results yet.