Transcription of Lecture Notes on Dynamic Programming
{{id}} {{{paragraph}}}
Example: confidence
Lecture Notes on Dynamic Programming
Lecture Notes onDynamic Programming15-122: Principles of Imperative ComputationFrank PfenningLecture 23 November 16, 20101 IntroductionIn this Lecture we introducedynamic Programming , which is a high-levelcomputational thinking concept rather than a concrete algorithm. Perhapsa more descriptive title for the Lecture would besharing, because dynamicprogramming is about sharing computation. We have already seen earlierthat sharing of space is also crucial: binary decision diagrams in which sub-trees are shared are (in practice) much more efficient than binary decisiontrees in which there is no order to apply Dynamic Programming , we generally look for the fol-lowing optimal solutions to a problem is composed of optimal solutionsto subproblems, there are several optimal solutions, we don t care which one we emphasis on optimality in these conditions dates back to the 1930 swhen Dynamic Programming was developed.
Lecture Notes on Dynamic Programming ... 1 Introduction In this lecture we introduce dynamic ... gramming in the sense of the operations research literature (like ...
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Operations Research, IE316, IE316 Lecture 7, Lecture, Notes, Introduction to Operations Research Economics, Lecture Notes, With GNU Linear Programming Kit, Operations Research with GNU Linear Programming Kit, LECTURE NOTES ON OPERATIONS RESEARCH, Operations Research Lecture 6: Integer Programming, Operations Research Lecture 6: Integer Programming Notes, Operations Research Lecture, Linear Programming Notes, Operations, Game Theory Lecture Notes, Game Theory