일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 |
Tags
- 엘리스 AI Edu Hackathon
- TheWorldStreetJournal
- docker
- HSAT
- stablediffusion
- SeriousPython
- 오렌지미디어
- 토스
- 팀네이버2024
- acrostic
- softeer
- reinforcement learning
- 도커
- JPub
- 윤성우
- GenAI
- ImageGeneration
- 진지한파이썬
- 팀네이버
- 파이썬
- 에어맵코리아
- Slash
- PromptEngineering
- AutoRL
- 개발자컨퍼런스
- 벨만방정식
- 복사측정술
- IJCAI
- 윤성우의열혈파이썬
- Physical Quantities
Archives
- Today
- Total
목록벨만방정식 (1)
코딩하는 임초얀
Bellman Equation
A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the "value" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem thatresults from those initial choices. This breaks a..
Wiki 한글 번역
2023. 3. 3. 17:16