Scribd Logo
Hochladen

Willkommen bei Scribd!

  • How The Recursive DP Unfolds

    Hochgeladen von

    Mun Kiat
    7 Ansichten2 Seiten
    This document describes how recursive dynamic programming works by showing an animated sequence of a cost function computation unfolding over time. It shows that a call is initiated with a colon and returns a value when it is resolved with a double colon. The goal is to compute the cost from index 1 to n by calling the cost function cmat. The cost between indices x and y is calculated as the minimum of the cost from x to i plus the cost from i+1 to y plus the product of values D at indices x, i, and y, iterating i from x to y-1.

    Originalbeschreibung:

    recursive dp

    Originaltitel

    How the Recursive DP Unfolds

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Verfügbare Formate

    PPTX, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document describes how recursive dynamic programming works by showing an animated sequence of a cost function computation unfolding over time. It shows that a call is initiated with a colon and returns a value when it is resolved with a double colon. The goal is to compute the cost from index 1 to n by calling the cost function cmat. The cost between indices x and y is calculated as the minimum of the cost from x to i plus the cost from i+1 to y plus the product of values D at indices x, i, and y, iterating i from x to y-1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PPTX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    7 Ansichten2 Seiten

    How The Recursive DP Unfolds

    Hochgeladen von

    Mun Kiat
    This document describes how recursive dynamic programming works by showing an animated sequence of a cost function computation unfolding over time. It shows that a call is initiated with a colon and returns a value when it is resolved with a double colon. The goal is to compute the cost from index 1 to n by calling the cost function cmat. The cost between indices x and y is calculated as the minimum of the cost from x to i plus the cost from i+1 to y plus the product of values D at indices x, i, and y, iterating i from x to y-1.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PPTX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 2

    How the recursive DP unfolds -an animated sequence

    : means that a call is initiated; the value has not been resolved
    : means that the value has been obtained

    Goal: cost[1,n]; computation unfolds after calling cmat(1,n): y n x=y

    0
    0 0 0 0 0 0 0
    1 2 n x
    2

    cost[x,y]= Min { cost[x,i] + cost[i+1,y]+D[x,1]*D[i,2]*D[y,2]} for x i<y

    Das könnte Ihnen auch gefallen