Lecture 23: Dynamic Programming
author: John Guttag,
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: April 2011, views: 2553
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
recorded by: Massachusetts Institute of Technology, MIT
published: Oct. 29, 2012, recorded: April 2011, views: 2553
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
This lecture introduces dynamic programming, and discusses the notions of optimal substructure and overlapping sub-problems.
Topics covered: Dynamic programming, optimal path, overlapping subproblems, weighted edges, specifications, restrictions, efficiency, pseudo-polynomials.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: