6.13:Dynamic Programming:Overlapping Subproblems,Optimal Substructu

Description
In this lecture we will talk about optimization problems in dynamic programming, there were two things to look for. One was overlapping sub-problems and the other one was optimal substructure. The notion here is that you can get a globally optimal solution from locally optimal solutions to sub-problems Dynamic programming is implimented with several examples.


"Prof. Eric Grimson& Prof. John Guttag, 6.13: Dynamic Programming:Overlapping Subproblems,Optimal Substruct 6.00 Introduction to Computer Science and Programming, Massachusetts Institute of Technology: MIT OpenCourseWare),http://ocw.mit.edu (30-07-2011). License: Creative Commons BY-NC-SA: http://ocw.mit.edu/terms/#cc"