dynamic programming

名词 n.
中文释义

英文释义

名词 n.
  1. 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. uncountable
    — The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.

词源

Coined by American mathematician Richard E. Bellman in the 1940s.
0 次浏览 数据来源: Wiktionary