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 176–200 of 261 papers

TitleStatusHype
Transition-Based Syntactic Linearization—0
Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints—0
Universal Policies for Software-Defined MDPs—0
Voxel selection framework based on meta-heuristic search and mutual information for brain decoding—0
Web Search Result Clustering based on Heuristic Search and k-means—0
Windowed MAPF with Completeness Guarantees—0
"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming—0
A*+BFHS: A Hybrid Heuristic Search Algorithm—0
Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees—0
A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem—0
Abstract Interpretation for Generalized Heuristic Search in Model-Based Planning—0
Action Selection for MDPs: Anytime AO* vs. UCT—0
A Formal Characterization of the Local Search Topology of the Gap Heuristic—0
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks—0
A Heuristic Search Algorithm for Solving First-Order MDPs—0
A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach—0
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains—0
A Hybrid Evolutionary Algorithm Framework for Optimising Power Take Off and Placements of Wave Energy Converters—0
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems—0
A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls—0
A Multi-Heuristic Search-based Motion Planning for Automated Parking—0
Analysis of English free association network reveals mechanisms of efficient solution of Remote Association Tests—0
An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns—0
An Efficient Incremental Simple Temporal Network Data Structure for Temporal Planning—0
An Empirical Study on Learning and Improving the Search Objective for Unsupervised Paraphrasing—0
Show:102550
← PrevPage 8 of 11Next →

No leaderboard results yet.