ePrivacy and GPDR Cookie Consent by Cookie Consent

What to read after Parallel Algorithms for Knapsack Type Problems?

Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "Parallel Algorithms for Knapsack Type Problems" by G. M. Megson! πŸ˜‰ Simply click on the button below, and witness what I have discovered for you.

Exciting news! I've found some fantastic books for you! πŸ“šβœ¨ Check below to see your tailored recommendations. Happy reading! πŸ“–πŸ˜Š

Parallel Algorithms for Knapsack Type Problems

G. M. Megson , Vassil Alexandrov

Computers / Systems Architecture / Distributed Systems & Computing

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.
Do you want to read this book? 😳
Buy it now!

Are you curious to discover the likelihood of your enjoyment of "Parallel Algorithms for Knapsack Type Problems" by G. M. Megson? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.