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

TitleStatusHype
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 10 of 27Next →

No leaderboard results yet.