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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
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
Optimistic variants of single-objective bilevel optimization for evolutionary algorithms
Few-shots Parallel Algorithm Portfolio Construction via Co-evolution
On Bellman's Optimality Principle for zs-POSGs
Dynamic User Pairing for Non-Orthogonal Multiple Access in Downlink Networks
Fanoos: Multi-Resolution, Multi-Strength, Interactive Explanations for Learned Systems
Learning Heuristic Selection with Dynamic Algorithm Configuration
Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions
Reactive Sample Size for Heuristic Search in Simulation-based Optimization
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising
Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)
gBeam-ACO: a greedy and faster variant of Beam-ACO
Multi-Resolution A*
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics
A Neural Architecture Search based Framework for Liquid State Machine Design
User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization
ARMS: Automated rules management system for fraud detection
GLSearch: Maximum Common Subgraph Detection via Learning to Search
Counterfactual Explanation Algorithms for Behavioral and Textual Data
The αμ Search Algorithm for the Game of Bridge
Buffer-aware Wireless Scheduling based on Deep Reinforcement Learning
Action Selection for MDPs: Anytime AO* vs. UCT
Temporal Planning with Intermediate Conditions and Effects
A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks
Compiler-Level Matrix Multiplication Optimization for Deep Learning
Efficient Multivariate Bandit Algorithm with Path Planning
Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters
Discovering Reliable Correlations in Categorical Data
GAN Path Finder: Preliminary results
ASNets: Deep Learning for Generalised Planning
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.