Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/38
Analysis of Algorithms
Lecture 18
Max Alekseyev
University of South Carolina
November 15, 2010
2/38
Outline
Dynamic Programming
Four-step Method
Rod Cutting Problem
Recursive Top-down Solution
Dynamic-programming Solution
Subproblem Graphs
Longest Common Subsequence
Elements of Dynamic Programming
3/38
Dynamic Programming
Not a specific algorithm, but a technique (like
divide-and-conquer).

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences