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 171–180 of 261 papers

TitleStatusHype
Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information Sharing—0
Counterfactual Explanation Algorithms for Behavioral and Textual DataCode0
The αμ Search Algorithm for the Game of Bridge—0
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning—0
Action Selection for MDPs: Anytime AO* vs. UCT—0
Neural Maximum Common Subgraph Detection with Guided Subgraph Extraction—0
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks—0
Temporal Planning with Intermediate Conditions and Effects—0
Compiler-Level Matrix Multiplication Optimization for Deep Learning—0
Efficient Multivariate Bandit Algorithm with Path Planning—0
Show:102550
← PrevPage 18 of 27Next →

No leaderboard results yet.