CS 580's course blog

Friday, November 2, 2012

Lecture 26 Dynamic programming

Today we talked about dyanmic programming. We showed how to use Dynamic Programming to solve the weight verision of activity selection.

Posted by yi at 5:24 AM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Labels

  • announcement (4)
  • data structure (8)
  • homework (1)
  • homework 2 (1)
  • lecture (21)

Blog Archive

  • ▼  2012 (61)
    • ►  December (5)
    • ▼  November (15)
      • Lecture 37 NP completeness
      • Lecture 36. More on NP-Completeness
      • Lecture 35. NP Completeness
      • Homework 6
      • Lecture 34. Applications of Max Flow
      • Lecture 33 Edmonds-Karp algorithm
      • Lecture 32 Max Flow Min Cut Theorem and Ford-Fulke...
      • Homework 3 distribution
      • Lecture 31 Max Flow and Min Cut
      • Lecture 30. Strongly Connected Component
      • Homework 5
      • Lecture 29 DFS, longest path, topological sort, an...
      • Lecture 28. Algorithms for finding the shortest path
      • Lecture 27. Dynamic Proigramming (2)
      • Lecture 26 Dynamic programming
    • ►  October (15)
    • ►  September (14)
    • ►  August (12)

Contributors

  • Siddharth
  • Unknown
  • yi
Simple theme. Powered by Blogger.