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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
DAGER: Exact Gradient Inversion for Large Language Models
Consolidating LAMA with Best-First Width Search
HSVI-based Online Minimax Strategies for Partially Observable Stochastic Games with Neural Perception Mechanisms
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning
Improving Learnt Local MAPF Policies with Heuristic Search
Policy-Space Search: Equivalences, Improvements, and Compression
Can Large Language Models Play Games? A Case Study of A Self-Play Approach
ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical Feedback
Domain-Independent Dynamic Programming
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
Act as You Learn: Adaptive Decision-Making in Non-Stationary Markov Decision Processes
Deep Generative Symbolic Regression
Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints
Towards Efficient Verification of Quantized Neural Networks
Rectangle Search: An Anytime Beam Search (Extended Version)
Planning for the Efficient Updating of Mutual Fund Portfolios
CylinderTag: An Accurate and Flexible Marker for Cylinder-Shape Objects Pose Estimation Based on Projective Invariants
Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning
A More General Theory of Diagnosis from First Principles
Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems
Heuristic Search for Path Finding with Refuelling
An Energy-Aware Approach to Design Self-Adaptive AI-based Applications on the Edge
"Would life be more interesting if I were in AI?" Answering Counterfactuals based on Probabilistic Inductive Logic Programming
RetroBridge: Modeling Retrosynthesis with Markov Bridges
SayCanPay: Heuristic Planning with Large Language Models using Learnable Domain Knowledge
Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results
Finding Optimal Diverse Feature Sets with Alternative Feature Selection
A Multi-Heuristic Search-based Motion Planning for Automated Parking
Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction
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
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.