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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Quantune: Post-training Quantization of Convolutional Neural Networks using Extreme Gradient Boosting for Fast Deployment
Factored World Models for Zero-Shot Generalization in Robotic Manipulation
Flipping the switch on local exploration: Genetic Algorithms with Reversals
Heuristic Search for Rank Aggregation with Application to Label Ranking
Unlocking the Secrets of Software Configuration Landscapes-Ruggedness, Accessibility, Escapability, and Transferability
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning
Bayesian Optimization over Permutation Spaces
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
A Novel Sleep Stage Classification Using CNN Generated by an Efficient Neural Architecture Search with a New Data Processing Trick
HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties
Ecological landscapes guide the assembly of optimal microbial communities
AMRA*: Anytime Multi-Resolution Multi-Heuristic A*
Distributed Mission Planning of Complex Tasks for Heterogeneous Multi-Robot Teams
Searching for More Efficient Dynamic Programs
Voxel selection framework based on meta-heuristic search and mutual information for brain decoding
A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls
Similarity Downselection: A Python implementation of a heuristic search algorithm for finding the set of the n most dissimilar items with an application in conformer sampling
Generalized Planning as Heuristic Search
Parallel Model Exploration for Tumor Treatment Simulations
Similarity-Based Equational Inference in Physics
A*+BFHS: A Hybrid Heuristic Search Algorithm
Policy-Guided Heuristic Search with Guarantees
S$^*$: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding
Fast threshold optimization for multi-label audio tagging using Surrogate gradient learning
Experience-Based Heuristic Search: Robust Motion Planning with Deep Q-Learning
Towards Optimally Efficient Search with Deep Learning for Large-Scale MIMO Systems
Universal Policies for Software-Defined MDPs
Deliberative and Conceptual Inference in Service Robots
Heuristic Domain Adaptation
RBF-HS: Recursive Best-First Hitting Set Search
Goal-directed Generation of Discrete Structures with Conditional Generative Models
Graph-based Heuristic Search for Module Selection Procedure in Neural Module Network
ChemoVerse: Manifold traversal of latent spaces for novel molecule discovery
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Analysis of English free association network reveals mechanisms of efficient solution of Remote Association Tests
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.