Parallel Algorithms For Knapsack Type Problems

Name: Parallel Algorithms For Knapsack Type Problems
Brand: World Scientific Publishing Co Pte Ltd
SKU: 9789810221201
Price: 2564 CZK
Availability: InStock

Autor: V.N. Aleksandrov, G.M. Megson

Jazyk:

Vazba: Pevná

Vydavatel: World Scientific Publishing Co Pte Ltd

Dostupnost: 50 % šance

Prohledáme celý svět

2 564 Kč

This text brings together current research directions in the mapping of dynamic programming problems...

Informace o knize

Autor

V.N. Aleksandrov, G.M. Megson

Jazyk

Angličtina

Vazba

Kniha - Pevná

Vydáno

1995

Stránek

216

EAN

9789810221201

ISBN

9810221207

Enbook ID

05065000

Vydavatel

World Scientific Publishing Co Pte Ltd

Hmotnost

297

Kompletní popis

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.

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Parallel Algorithms For Knapsack Type Problems

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také