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 131–140 of 261 papers

TitleStatusHype
Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments—0
On the Discrimination Power and Effective Utilization of Active Learning Measures in Version Space Search—0
On the Linear Belief Compression of POMDPs: A re-examination of current methods—0
On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection—0
Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring—0
Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing—0
Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing—0
Optimal Settings for Cryptocurrency Trading Pairs—0
Optimising 4th-Order Runge-Kutta Methods: A Dynamic Heuristic Approach for Efficiency and Low Storage—0
Optimizing Dynamic Structures with Bayesian Generative Search—0
Show:102550
← PrevPage 14 of 27Next →

No leaderboard results yet.