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 226250 of 261 papers

TitleStatusHype
On the Linear Belief Compression of POMDPs: A re-examination of current methods0
An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns0
Grid-based angle-constrained path planning0
Transition-Based Syntactic Linearization0
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version0
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?0
A Heuristic Search Algorithm for Solving First-Order MDPs0
Generating Acrostics via Paraphrasing and Heuristic Search0
Cascading A*: a Parallel Approach to Approximate Heuristic Search0
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes0
Homotopy based algorithms for _0-regularized least-squares0
COLIN: Planning with Continuous Linear Numeric Change0
Avoiding and Escaping Depressions in Real-Time Heuristic Search0
On-line Planning and Scheduling: An Application to Controlling Modular Printers0
Best-First Heuristic Search for Multicore Machines0
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding0
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks0
Topological Value Iteration Algorithms0
Implicit Abstraction Heuristics0
Online Planning Algorithms for POMDPs0
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains0
Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks0
On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection0
The Partner Units Configuration Problem: Completing the Picture0
Search-Space Characterization for Real-time Heuristic Search0
Show:102550
← PrevPage 10 of 11Next →

No leaderboard results yet.