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 76–100 of 261 papers

TitleStatusHype
SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge—0
Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results—0
Finding Optimal Diverse Feature Sets with Alternative Feature SelectionCode0
A Multi-Heuristic Search-based Motion Planning for Automated Parking—0
Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction—0
Multi-Robot Path Planning Combining Heuristics and Multi-Agent Reinforcement Learning—0
Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning—0
Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring—0
Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex ColoringCode0
Search-Map-Search: A Frame Selection Paradigm for Action Recognition—0
MEMA Runtime Framework: Minimizing External Memory Accesses for TinyML on Microcontrollers—0
A Novel Point-based Algorithm for Multi-agent Control Using the Common Information ApproachCode0
Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+—0
Heuristic Search for Multi-Objective Probabilistic Planning—0
BeamAttack: Generating High-quality Textual Adversarial Examples through Beam Search and Mixed Semantic SpacesCode0
Bayesian Decision Trees via Tractable Priors and Probabilistic Context-Free Grammars—0
Optimization of Topology-Aware Job Allocation on a High-Performance Computing Cluster by Neural Simulated AnnealingCode0
Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objectsCode0
Asynchronously Trained Distributed Topographic Maps—0
Statistical Distance Based Deterministic Offspring Selection in SMC Methods—0
An Efficient Incremental Simple Temporal Network Data Structure for Temporal Planning—0
Ultrafast learning of 4-node hybridization cycles in phylogenetic networks using algebraic invariantsCode0
Encoder-Decoder Model for Suffix Prediction in Predictive Monitoring—0
Shielding in Resource-Constrained Goal POMDPsCode0
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical PlanningCode0
Show:102550
← PrevPage 4 of 11Next →

No leaderboard results yet.