Browsing Computer Science - Undergraduate degree by Subject "Unbounded knapsack problem"
Now showing items 1-2 of 2
-
An efficient dynamic programming algorithm for the Unbounded Knapsack Problem
(2013) [Work completion of graduation]This report describes an algorithm for the Unbounded Knapsack Problem based on the algorithm EDUK (Efficient Dynamic Programming for the Unbounded Knapsack Problem). EDUK takes advantage of the problem properties of dominance ... -
Programação dinâmica eficiente com algoritmos Cache-Oblivious
(2008) [Work completion of graduation]A memória nos computadores modernos geralmente está organizada em uma hierarquia complexa. Dessa forma, torna-se importante projetar algoritmos que utilizem a cache de forma eficiente. Além disso, as configurações da memória ...