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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Automatic Generation of Atomic Consistency Preserving Search Operators for Search-Based Model Engineering
AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Rates
Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths
Direct Policy Gradients: Direct Optimization of Policies in Discrete Action Spaces
Exponential-Binary State-Space Search
Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees
Optimal Decision Making Under Strategic Behavior
Optimizing Sequential Medical Treatments with Auto-Encoding Heuristic Search in POMDPs
Improved Safe Real-time Heuristic Search
Semantic variation operators for multidimensional genetic programming
A Hybrid Evolutionary Algorithm Framework for Optimising Power Take Off and Placements of Wave Energy Converters
Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
A One-Class Support Vector Machine Calibration Method for Time Series Change Point Detection
Single-Agent Policy Tree Search With Guarantees
Combining Deep Learning and Qualitative Spatial Reasoning to Learn Complex Structures from Sparse Examples with Noise
Mean-based Heuristic Search for Real-Time Planning
Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles
The Actor Search Tree Critic (ASTC) for Off-Policy POMDP Learning in Medical Decision Making
Heuristics for vehicle routing problems: Sequence or set optimization?
Testing Deep Neural Networks
DeepType: Multilingual Entity Linking by Neural Type System Evolution
Get Your Workload in Order: Game Theoretic Prioritization of Database Auditing
A Heuristic Search Algorithm Using the Stability of Learning Algorithms in Certain Scenarios as the Fitness Function: An Artificial General Intelligence Engineering Approach
Heuristic Search for Structural Constraints in Data Association
Evolving Deep Convolutional Neural Networks for Image Classification
On the Discrimination Power and Effective Utilization of Active Learning Measures in Version Space Search
Solving Mixed Model Workplace Time-dependent Assembly Line Balancing Problem with FSS Algorithm
Learning Heuristic Search via Imitation
Neural Machine Translation with Gumbel-Greedy Decoding
A Formal Characterization of the Local Search Topology of the Gap Heuristic
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions
Generation of Near-Optimal Solutions Using ILP-Guided Sampling
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.