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 61–70 of 261 papers

TitleStatusHype
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning—0
Improving Learnt Local MAPF Policies with Heuristic Search—0
Policy-Space Search: Equivalences, Improvements, and Compression—0
Can Large Language Models Play Games? A Case Study of A Self-Play Approach—0
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems—0
Act as You Learn: Adaptive Decision-Making in Non-Stationary Markov Decision ProcessesCode0
Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints—0
Towards Efficient Verification of Quantized Neural NetworksCode0
Rectangle Search: An Anytime Beam Search (Extended Version)Code0
Planning for the Efficient Updating of Mutual Fund Portfolios—0
Show:102550
← PrevPage 7 of 27Next →

No leaderboard results yet.