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 141–150 of 261 papers

TitleStatusHype
A*+BFHS: A Hybrid Heuristic Search Algorithm—0
GLSearch: Maximum Common Subgraph Detection via Learning to Search—0
Feature-Based Diversity Optimization for Problem Instance Classification—0
FedMoE: Personalized Federated Learning via Heterogeneous Mixture of Experts—0
Few-shots Parallel Algorithm Portfolio Construction via Co-evolution—0
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments—0
gBeam-ACO: a greedy and faster variant of Beam-ACO—0
Generalized Planning as Heuristic Search—0
Generating Acrostics via Paraphrasing and Heuristic Search—0
Generation of Near-Optimal Solutions Using ILP-Guided Sampling—0
Show:102550
← PrevPage 15 of 27Next →

No leaderboard results yet.