Parallel Algorithms For Knapsack Type Problems e-bog
337,32 DKK
(inkl. moms 421,65 DKK)
This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on sub...
E-bog
337,32 DKK
Forlag
World Scientific
Udgivet
1 juni 1999
Længde
216 sider
Genrer
UKG
Sprog
English
Format
pdf
Beskyttelse
LCP
ISBN
9789814500999
This book brings together current research direction in the mapping of dynamic programming recurrence equations for Knapsack Type problems, which include Unbounded Knapsack Problem, 0/1 Knapsack Problem, Subset Sum Problem, Change Making Problem, onto so-called regular parallel architectures. In particular, it focuses on heuristic and more formal techniques for mapping. The text is based on substantially revised papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.