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.
코드
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
https://github.com/jsego/bfgp-pp
Representation and Synthesis of C++ Programs for Generalized Planning
https://github.com/omron-sinicx/planning-datasets
https://github.com/ondrejba/action_attention_iclr_22
Factored World Models for Zero-Shot Generalization in Robotic Manipulation
https://github.com/sisl/CMSSPs.jl
Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths
https://github.com/verbal-noun/a-star-pathfinding-family
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions
https://github.com/yramon/ShapCounterfactual
Counterfactual Explanation Algorithms for Behavioral and Textual Data
https://github.com/yramon/edc
Counterfactual Explanation Algorithms for Behavioral and Textual Data
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.