dynamic programming
Word Rarity
Uncommon
Frequency: Zipf frequency 4.04 in modern English
34
Scrabble Score
18
Letters
5
Syllables
11
Unique Chars
Meaning
noun
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
Example Sentences
- "The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition."
- "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."