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 41–50 of 261 papers

TitleStatusHype
Consolidating LAMA with Best-First Width Search—0
HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms—0
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
ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical FeedbackCode2
Domain-Independent Dynamic ProgrammingCode2
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
Show:102550
← PrevPage 5 of 27Next →

No leaderboard results yet.