Data & IT
Parallel Algorithms For Knapsack Type Problems
Vassil N Aleksandrov • G M Megson • Vassil N Aleksandrov • G M Megson • G M Megson V N Alexandrov
Inbunden
2289:-
Tillfälligt slut online – klicka på "Bevaka" för att få ett mejl så fort varan går att köpa igen.
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.
- Format: Inbunden
- ISBN: 9789810221201
- Språk: Engelska
- Antal sidor: 216
- Utgivningsdatum: 1999-06-02
- Förlag: World Scientific Publishing Co Pte Ltd