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 31–40 of 261 papers

TitleStatusHype
Microgrid Planner: A Distributed Energy Resource Sizing Method—0
LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path PlanningCode2
Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning—0
BlockPruner: Fine-grained Pruning for Large Language ModelsCode1
Diffusion-based Reinforcement Learning for Dynamic UAV-assisted Vehicle Twins Migration in Vehicular Metaverses—0
SLOPE: Search with Learned Optimal Pruning-based ExpansionCode0
Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability ObjectivesCode0
Using Constraints to Discover Sparse and Alternative Subgroup DescriptionsCode0
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)Code0
DAGER: Exact Gradient Inversion for Large Language ModelsCode1
Show:102550
← PrevPage 4 of 27Next →

No leaderboard results yet.