dynamic programming

From Wiktionary, the free dictionary
Archived revision by AryamanA (talk | contribs) as of 04:31, 12 November 2018.
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

English

English Wikipedia has an article on:
Wikipedia

Etymology

Coined by American applied mathematician Richard Bellman in the 1950s.

Noun

dynamic programming (uncountable)

  1. (mathematics, computer science) 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.
Retrieved from "https://en.wiktionary.org/w/index.php?title=dynamic_programming&oldid=50671313"