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 151–160 of 261 papers

TitleStatusHype
Dynamic User Pairing for Non-Orthogonal Multiple Access in Downlink Networks—0
Fanoos: Multi-Resolution, Multi-Strength, Interactive Explanations for Learned SystemsCode0
Learning Heuristic Selection with Dynamic Algorithm ConfigurationCode0
Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions—0
Reactive Sample Size for Heuristic Search in Simulation-based Optimization—0
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising—0
Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)—0
gBeam-ACO: a greedy and faster variant of Beam-ACO—0
Multi-Resolution A*—0
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics—0
Show:102550
← PrevPage 16 of 27Next →

No leaderboard results yet.