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 41–50 of 261 papers

TitleStatusHype
MeshA*: Efficient Path Planing With Motion Primitives—0
Solving 7x7 Killall-Go with Seki Database—0
Deep Memory Search: A Metaheuristic Approach for Optimizing Heuristic Search—0
Efficient Reinforcement Learning with Large Language Model Priors—0
Windowed MAPF with Completeness Guarantees—0
LaMMA-P: Generalizable Multi-Agent Long-Horizon Task Allocation and Planning with LM-Driven PDDL Planner—0
Multi-objective Evolution of Heuristic Using Large Language Model—0
HTS-Attack: Heuristic Token Search for Jailbreaking Text-to-Image Models—0
FedMoE: Personalized Federated Learning via Heterogeneous Mixture of Experts—0
Pareto local search for a multi-objective demand response problem in residential areas with heat pumps and electric vehiclesCode0
Show:102550
← PrevPage 5 of 27Next →

No leaderboard results yet.