Parallel Algorithms for Knapsack Type Problems - Aleksandrov, Vassil N; Megson, G M
122,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
61 °P sammeln
  • Gebundenes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.