'Cut rod' presentation slideshows

Dynamic Programming

609 views • 39 slides

Dynamic Programming

668 views • 39 slides

Dynamic Programming

755 views • 38 slides

Dynamic Programming

?? ???? ????????????. Dynamic Programming. Rod cutting problem. Given a rod of length N inches and a table of prices p[i] for i=1..N , determine the maximum revenue r[N] obtainable by cutting up the rod and selling the pieces. Eg ?. N=7, 7=3+4 produces revenue 17

393 views • 38 slides

Dynamic Programming Code

Dynamic Programming Code. Straightforward top-down rod cutting. CUT-ROD(p, n) If n == 0 Return 0 q = -1 For I = 1 to n q = max (q, p[ i ] + CUT-ROD(p, n- i )) Return q. Memoization in rod cutting. MEMOIZED-CUT-ROD(p, n) let r[0..n] be a new array f or I = 0 to n r[ i ] = -1

581 views • 26 slides

CSCI 6212 Design and Analysis of Algorithms Dynamic Programming

CSCI 6212 Design and Analysis of Algorithms Dynamic Programming. Dr. Juman Byun The George Washington University. Please drop this course if you have not taken the following prerequisite. Sometimes enthusiasm alone is not enough. CSci 1311: Discrete Structures I (3)

422 views • 15 slides