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 121–130 of 261 papers

TitleStatusHype
Feature-Based Diversity Optimization for Problem Instance Classification—0
Heuristics for vehicle routing problems: Sequence or set optimization?—0
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning—0
GLSearch: Maximum Common Subgraph Detection via Learning to Search—0
A Neural Architecture Search based Framework for Liquid State Machine Design—0
HSVI can solve zero-sum Partially Observable Stochastic Games—0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?—0
Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions—0
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics—0
Best-First Heuristic Search for Multicore Machines—0
Show:102550
← PrevPage 13 of 27Next →

No leaderboard results yet.