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.
"synopsis" may belong to another edition of this title.
US$ 34.30 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: BOOKWEST, Phoenix, AZ, U.S.A.
Hardcover. Condition: New. US SELLER SHIPS FAST FROM USA. Seller Inventory # INTOK-132E3-9810221207
Quantity: 1 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. Like NewLIKE NEW. book. Seller Inventory # ERICA83798102212073
Quantity: 1 available