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 111–120 of 261 papers

TitleStatusHype
Representation, learning, and planning algorithms for geometric task and motion planning—0
Quantune: Post-training Quantization of Convolutional Neural Networks using Extreme Gradient Boosting for Fast DeploymentCode1
Factored World Models for Zero-Shot Generalization in Robotic ManipulationCode0
Flipping the switch on local exploration: Genetic Algorithms with ReversalsCode1
Heuristic Search for Rank Aggregation with Application to Label Ranking—0
Unlocking the Secrets of Software Configuration Landscapes-Ruggedness, Accessibility, Escapability, and Transferability—0
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning—0
Bayesian Optimization over Permutation SpacesCode1
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies—0
A Novel Sleep Stage Classification Using CNN Generated by an Efficient Neural Architecture Search with a New Data Processing Trick—0
Show:102550
← PrevPage 12 of 27Next →

No leaderboard results yet.