Papers with Code 아카이브
Heuristic Search
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The Best Input Parameters For R* Algorithm Through Series Of Experiments
Feature-Based Diversity Optimization for Problem Instance Classification
PERCH: Perception via Search for Multi-Object Recognition and Localization
Web Search Result Clustering based on Heuristic Search and k-means
On the Linear Belief Compression of POMDPs: A re-examination of current methods
An Efficient Genetic Algorithm for Discovering Diverse-Frequent Patterns
Grid-based angle-constrained path planning
Influence-Optimistic Local Values for Multiagent Planning --- Extended Version
Bi-directional Shape Correspondences (BSC): A Novel Technique for 2-d Shape Warping in Quadratic Time?
A Heuristic Search Algorithm for Solving First-Order MDPs
Cascading A*: a Parallel Approach to Approximate Heuristic Search
Local Optima Networks: A New Model of Combinatorial Fitness Landscapes
Homotopy based algorithms for $\ell_0$-regularized least-squares
Avoiding and Escaping Depressions in Real-Time Heuristic Search
COLIN: Planning with Continuous Linear Numeric Change
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
Implicit Abstraction Heuristics
Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding
Best-First Heuristic Search for Multicore Machines
On-line Planning and Scheduling: An Application to Controlling Modular Printers
Topological Value Iteration Algorithms
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains
Online Planning Algorithms for POMDPs
Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks
On the Success Rate of Crossover Operators for Genetic Programming with Offspring Selection
The Partner Units Configuration Problem: Completing the Picture
Search-Space Characterization for Real-time Heuristic Search
Inconsistency and Accuracy of Heuristics with A* Search
Ideal Reformulation of Belief Networks
Heuristic Search as Evidential Reasoning
Defeasible Decisions: What the Proposal is and isn't
The Optimality of Satisficing Solutions
Induction, of and by Probability
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Interactive Ant Colony Optimisation (iACO) for Early Lifecycle Software Design
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.