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 141–150 of 261 papers

TitleStatusHype
Optimizing Minimum Vertex Cover Solving via a GCN-assisted Heuristic Algorithm—0
Optimizing Sequential Medical Treatments with Auto-Encoding Heuristic Search in POMDPs—0
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles—0
PERCH: Perception via Search for Multi-Object Recognition and Localization—0
User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization—0
Planning for the Efficient Updating of Mutual Fund Portfolios—0
Policy-Space Search: Equivalences, Improvements, and Compression—0
Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning—0
Reactive Sample Size for Heuristic Search in Simulation-based Optimization—0
Representation, learning, and planning algorithms for geometric task and motion planning—0
Show:102550
← PrevPage 15 of 27Next →

No leaderboard results yet.