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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Multi-Robot Path Planning Combining Heuristics and Multi-Agent Reinforcement Learning
Scale-Adaptive Balancing of Exploration and Exploitation in Classical Planning
Opti Code Pro: A Heuristic Search-based Approach to Code Refactoring
Generic and Robust Root Cause Localization for Multi-Dimensional Data in Online Service Systems
Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring
Search-Map-Search: A Frame Selection Paradigm for Action Recognition
MEMA Runtime Framework: Minimizing External Memory Accesses for TinyML on Microcontrollers
A Novel Point-based Algorithm for Multi-agent Control Using the Common Information Approach
Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+
Heuristic Search for Multi-Objective Probabilistic Planning
BeamAttack: Generating High-quality Textual Adversarial Examples through Beam Search and Mixed Semantic Spaces
Bayesian Decision Trees via Tractable Priors and Probabilistic Context-Free Grammars
Optimization of Topology-Aware Job Allocation on a High-Performance Computing Cluster by Neural Simulated Annealing
Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects
Asynchronously Trained Distributed Topographic Maps
Statistical Distance Based Deterministic Offspring Selection in SMC Methods
TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers
An Efficient Incremental Simple Temporal Network Data Structure for Temporal Planning
Ultrafast learning of 4-node hybridization cycles in phylogenetic networks using algebraic invariants
Encoder-Decoder Model for Suffix Prediction in Predictive Monitoring
Shielding in Resource-Constrained Goal POMDPs
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning
HSVI can solve zero-sum Partially Observable Stochastic Games
Optimal Settings for Cryptocurrency Trading Pairs
Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?
Aerial View Localization with Reinforcement Learning: Towards Emulating Search-and-Rescue
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems
Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays
Survey on Evolutionary Deep Learning: Principles, Algorithms, Applications and Open Issues
Non-Blocking Batch A* (Technical Report)
Abstract Interpretation for Generalized Heuristic Search in Model-Based Planning
Learning to Solve Soft-Constrained Vehicle Routing Problems with Lagrangian Relaxation
Syntax Controlled Knowledge Graph-to-Text Generation with Order and Semantic Consistency
Representation and Synthesis of C++ Programs for Generalized Planning
Dense Crowd Flow-Informed Path Planning
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.