Mohlo by sa vám tiež páčiť

Informovať o naskladnení knihy

Viac informácií o knihe Parallel Algorithms For Knapsack Type Problems

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 372 bodov

Anotácia knihy

This text brings together current research directions in the mapping of dynamic programming problems classified as knapsack type recurrence equations which include: the unbounded knapsack problem; 0/1 knapsack problem; subset sum problem; and change making problem. In particular, it focuses on heuristic and more formal techniques for mapping such problems onto so-called regular parallel architectures. The text is based on papers published by the authors and their colleagues in the literature but re-written to provide an overall view of the subject area.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Computer architecture & logic design

• Celý názov: Parallel Algorithms For Knapsack Type Problems
• Autor: V.N. Aleksandrov, G.M. Megson
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 216
• EAN: 9789810221201
• ISBN: 9810221207
• ID: 05065000
• Nakladateľ: World Scientific Publishing Co Pte Ltd
• Dátum vydania: 28. July 1995

Obľúbené z iného súdka

---

---

---