Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
courses:cs211:winter2014:journals:kinsey:home [2014/03/25 22:45] – [6.3] schellkcourses:cs211:winter2014:journals:kinsey:home [2014/04/03 15:32] (current) – [7.7] schellk
Line 165: Line 165:
 Readability: 10 Readability: 10
  
-====== Chapter 6 ======+====== Chapter 6: Dynamic Programming ======
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.21_pm.png|}} {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.21_pm.png|}}
 Readability: 10 Readability: 10
-====== 6.1 ======+====== 6.1 Weighted Interval Scheduling a Recursive Procedure ======
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.27_pm.png|}} {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.27_pm.png|}}
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.36_pm.png|}} {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.36_pm.png|}}
 Readability: 9 Readability: 9
-====== 6.2 ======+====== 6.2 Principles of Dynamic Programming: Memoization or Iteration over Subproblems ======
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.42_pm.png|}} {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.42_pm.png|}}
 Readability: 9 Readability: 9
-====== 6.3 ======+====== 6.3 Segmented Least Squares: Multiway Choices====== 
 +{{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.48_pm.png|}}
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.54_pm.png|}} {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.38.54_pm.png|}}
  
 Readability: 8 Readability: 8
-====== 6.4 ======+====== 6.4 Subset Sums and Knapsacks: Adding a Variable ====== 
 +{{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.39.01_pm.png|}}
 {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.39.08_pm.png|}} {{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-03-25_at_6.39.08_pm.png|}}
 Readability: 7 Readability: 7
  
 +====== 7.1 Maximum Flow Problem and the Ford-Fulkerson Algorithm ======
 +{{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-04-01_at_9.38.12_am.png |}}
 +Readability: 7.2
 +====== 7.2 Maximum Flows and Minimum Cuts in a Network ======
 +{{:courses:cs211:winter2014:journals:kinsey:screen_shot_2014-04-01_at_10.20.54_am.png|}}
 +Readability: 7
 +
 +====== 7.5 ======
 +{{:courses:cs211:winter2014:journals:kinsey:screenshot_from_2014-04-01_21_43_21.png?200|}}
 +Readability: 3
 +
 +====== 7.7 ======
 +{{:courses:cs211:winter2014:journals:kinsey:s1.jpg|}}
 +Readability: 2
  
  
  
  
courses/cs211/winter2014/journals/kinsey/home.1395787524.txt.gz · Last modified: 2014/03/25 22:45 by schellk
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0