madcannibal's blog

Top-Down to Bottom-Up
By madcannibal, history, 11 years ago, In English

Can be a rule there to transform the Top-Down to Bottom-Up ?

Tags dp
  • Vote: I like it
  • -5
  • Vote: I do not like it

»
11 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

?????

→ Reply
»
11 years ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

You need to be more specific to get a definitive answer.

Generally though, dynamic programming is essentially traversing a directed graph of states (vertices) and dependencies between them (arcs). It depends on the problem whether it is feasible to, looking at a certain state, list all incoming edges, or all outgoing edges, or both.

→ Reply
  • »
    »
    11 years ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it 0 Vote: I do not like it

    I think I understand him, I think he needs some tips to transform Top-Down recursive with memoization dynamic programming to Bottom-Up with loops!

    → Reply