{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec20 - 6.006 Introduction to Algorithms Lecture 20 Dynamic...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6.006 Introduction to Algorithms Lecture 20: Dynamic Programming III Prof. Erik Demaine Today • Dynamic programming review • Guessing – Within a subproblem – Using additional subproblems • Parenthesization • Knapsack • Tetris training Dynamic Programming History ‘Bellman … explained that he invented the name “dynamic programming” to hide the fact that he was doing mathematical research at RAND under a Secretary of Defense who “had a pathological fear and hatred of the term, research.” He settled on “dynamic programming” because it would be difficult give it a “pejorative meaning” and because “It was something not even a Congressman could object to.” ’ [John Rust 2006] http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.87.2819&rep=rep1&type=pdf Richard E. Bellman (1920–1984) IEEE Medal of Honor, 1979 http://www.amazon.com/Bellman‐Continuum‐ Collection‐Works‐Richard/dp/9971500906 What is Dynamic Programming? • “Controlled” brute force / exhaustive search • Key ideas: – Subproblems: like original problem, but smaller • Write solution to one subproblem in terms of solutions to smaller subproblems – Memoization: remember the solution to subproblems we’ve already solved, and re‐use • Avoid exponentials – Guessing: if you don’t know something, guess it!...
View Full Document

{[ snackBarMessage ]}

Page1 / 27

lec20 - 6.006 Introduction to Algorithms Lecture 20 Dynamic...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online