dynamic programming
명사
An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
용법- 불가산
- 관련 단어
- 예문
-
The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.
더 많은 예문 (1)
Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.