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 31–40 of 261 papers

TitleStatusHype
Heuristic Authorship ObfuscationCode0
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node ExpansionsCode0
A Novel Point-based Algorithm for Multi-agent Control Using the Common Information ApproachCode0
Finding Optimal Diverse Feature Sets with Alternative Feature SelectionCode0
Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objectsCode0
Hybrid Planning for Dynamic Multimodal Stochastic Shortest PathsCode0
Evolving Deep Convolutional Neural Networks for Image ClassificationCode0
An Energy-Aware Approach to Design Self-Adaptive AI-based Applications on the EdgeCode0
Factored World Models for Zero-Shot Generalization in Robotic ManipulationCode0
Discovering Reliable Dependencies from Data: Hardness and Improved AlgorithmsCode0
Show:102550
← PrevPage 4 of 27Next →

No leaderboard results yet.