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 201–210 of 261 papers

TitleStatusHype
Neural Maximum Common Subgraph Detection with Guided Subgraph Extraction—0
Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?—0
Non-Blocking Batch A* (Technical Report)—0
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning—0
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains—0
On Bellman's Optimality Principle for zs-POSGs—0
Online Planning Algorithms for POMDPs—0
On-line Planning and Scheduling: An Application to Controlling Modular Printers—0
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
Show:102550
← PrevPage 21 of 27Next →

No leaderboard results yet.