방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 제약 프로그래밍× | 딥 강화학습× | |
|---|---|---|
| 분야≠ | 최적화 | 딥러닝 |
| 계열≠ | Process / pipeline | Machine learning |
| 기원 연도≠ | 2006 | 2015 |
| 창시자≠ | Rossi, van Beek & Walsh | Mnih, V. et al. (DQN) |
| 유형≠ | Declarative combinatorial optimization | Sequential decision-making (agent–environment interaction) |
| 원전≠ | Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4 | Mnih, V. et al. (2015). Human-Level Control through Deep Reinforcement Learning. Nature, 518, 529–533. DOI ↗ |
| 별칭≠ | Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization | Derin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRL |
| 관련≠ | 3 | 4 |
| 요약≠ | Constraint Programming (CP) is a declarative optimization paradigm in which a problem is formulated as a set of variables, finite domains, and constraints, and a solver systematically searches for assignments that satisfy all constraints. Formalized comprehensively by Rossi, van Beek, and Walsh in their 2006 Handbook of Constraint Programming, CP unifies propagation-based pruning with intelligent backtracking search to tackle combinatorial problems across scheduling, planning, and configuration domains. | Deep Reinforcement Learning combines neural networks with reinforcement learning so an agent learns by interacting with an environment, popularised by Mnih and colleagues' 2015 Nature work on human-level Atari control. Instead of learning from a fixed labelled dataset, the agent takes actions, observes rewards, and gradually shapes a policy that maximises long-run return. |
| ScholarGate데이터셋 ↗ |
|
|