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

Showing 151175 of 261 papers

TitleStatusHype
Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems0
Get Your Workload in Order: Game Theoretic Prioritization of Database Auditing0
Goal-directed Generation of Discrete Structures with Conditional Generative Models0
Graph-based Heuristic Search for Module Selection Procedure in Neural Module Network0
Grid-based angle-constrained path planning0
Hardware Distortion Modeling for Panel Selection in Large Intelligent Surfaces0
Heuristic Search as Evidential Reasoning0
Heuristic Search for Multi-Objective Probabilistic Planning0
Heuristic Search for Path Finding with Refuelling0
Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+0
Heuristic Search for Rank Aggregation with Application to Label Ranking0
Heuristic Search for Structural Constraints in Data Association0
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning0
Heuristics for vehicle routing problems: Sequence or set optimization?0
Homotopy based algorithms for _0-regularized least-squares0
HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms0
HSVI can solve zero-sum Partially Observable Stochastic Games0
HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties0
Ideal Reformulation of Belief Networks0
Implicit Abstraction Heuristics0
Improved Safe Real-time Heuristic Search0
Improving Learnt Local MAPF Policies with Heuristic Search0
Inconsistency and Accuracy of Heuristics with A* Search0
Induction, of and by Probability0
Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters0
Show:102550
← PrevPage 7 of 11Next →

No leaderboard results yet.