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
Optimising 4th-Order Runge-Kutta Methods: A Dynamic Heuristic Approach for Efficiency and Low Storage—0
NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling—0
Soft Reasoning: Navigating Solution Spaces in Large Language Models through Controlled Embedding Exploration—0
Movable-Element STARS-Assisted Near-Field Wideband Communications—0
Consistency-based Abductive Reasoning over Perceptual Errors of Multiple Pre-trained Models in Novel Environments—0
Skip-Thinking: Chunk-wise Chain-of-Thought Distillation Enable Smaller Language Models to Reason Better and Faster—0
A Survey on Mathematical Reasoning and Optimization with Large Language ModelsCode0
A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem—0
Optimizing Minimum Vertex Cover Solving via a GCN-assisted Heuristic Algorithm—0
Automatic Prompt Optimization via Heuristic Search: A Survey—0
Show:102550
← PrevPage 1 of 27Next →

No leaderboard results yet.