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
133.13 €
Availability:
50/50We 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 333 loyalty points
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 category Books in English Computing & information technology Computer science Computer architecture & logic design
133.13 €
Collection points Bratislava a 2642 dalších
Copyright ©2008-24 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
Shopping cart ( Empty )