dynamic programming
English
Etymology
Coined by American applied mathematician Richard Bellman in the 1950s.
Noun
dynamic programming (uncountable)
- (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.
This article is issued from
Wiktionary.
The text is licensed under Creative
Commons - Attribution - Sharealike.
Additional terms may apply for the media files.