V N Alexandrov,
G M Megson
PARALLEL ALGORITHMS FOR KNAPSACK TYPE PROBLEMS
Gebonden Engels 1999 9789810221201Levertijd ongeveer 11 werkdagen
Gratis verzonden
Samenvatting
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.
Specificaties
ISBN13:9789810221201
Taal:Engels
Bindwijze:Gebonden
Aantal pagina's:216
Uitgever:World Scientific Publishing Co Pte Ltd
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
Linear arrays; probabilistic bounds; designing 2D regular arrays; distributed memory implementation; mapping integral recurrences onto regular arrays; mapping onto fixed size arrays with lower dimensions; comparison of techniques.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan