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 1–10 of 261 papers

TitleStatusHype
SAM2Long: Enhancing SAM 2 for Long Video Segmentation with a Training-Free Memory TreeCode4
SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQLCode2
LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path PlanningCode2
ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical FeedbackCode2
Domain-Independent Dynamic ProgrammingCode2
KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree SearchCode1
HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMsCode1
Learning Discrete World Models for Heuristic SearchCode1
POGEMA: A Benchmark Platform for Cooperative Multi-Agent PathfindingCode1
BlockPruner: Fine-grained Pruning for Large Language ModelsCode1
Show:102550
← PrevPage 1 of 27Next →

No leaderboard results yet.