dynamic programming
Nomina
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.
Penggunaan- tidak dapat dihitung
- Kata terkait
- Contoh
-
The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.
Lebih banyak contoh (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.