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

TitleStatusHype
KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree SearchCode1
Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and LearningCode1
A Formal Characterization of the Local Search Topology of the Gap Heuristic—0
Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays—0
Computing Programs for Generalized Planning as Heuristic Search—0
A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls—0
Approximating Permutations with Neural Network Components for Travelling Photographer Problem—0
Abstract Interpretation for Generalized Heuristic Search in Model-Based Planning—0
Consistency-based Abductive Reasoning over Perceptual Errors of Multiple Pre-trained Models in Novel Environments—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
A One-Class Support Vector Machine Calibration Method for Time Series Change Point Detection—0
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems—0
A Novel Sleep Stage Classification Using CNN Generated by an Efficient Neural Architecture Search with a New Data Processing Trick—0
Can Large Language Models Play Games? A Case Study of A Self-Play Approach—0
A Hybrid Evolutionary Algorithm Framework for Optimising Power Take Off and Placements of Wave Energy Converters—0
Compiler-Level Matrix Multiplication Optimization for Deep Learning—0
Consolidating LAMA with Best-First Width Search—0
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning—0
A Neural Architecture Search based Framework for Liquid State Machine Design—0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?—0
Best-First Heuristic Search for Multicore Machines—0
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains—0
Cascading A*: a Parallel Approach to Approximate Heuristic Search—0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding—0
Action Selection for MDPs: Anytime AO* vs. UCT—0
Show:102550
← PrevPage 2 of 11Next →

No leaderboard results yet.