Code: 05065000
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 ... more
English
108.59 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 264 loyalty points
Book synopsis
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.
Book details
Book category Knihy po anglicky Computing & information technology Computer science Computer architecture & logic design
108.59 €
English
Osobný odber Bratislava a 13398 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
25 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )