Parallel Algorithms For Knapsack Type Problems
Author:   Vassil N Aleksandrov (Univ Of Reading, Uk) ,  G M Megson (Univ Of Reading, Uk)
Publisher:   World Scientific Publishing Co Pte Ltd
ISBN:  

9789810221201


Pages:   216
Publication Date:   02 June 1999
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $300.96 Quantity:  
Add to Cart

Share |

Parallel Algorithms For Knapsack Type Problems


Overview

Full Product Details

Author:   Vassil N Aleksandrov (Univ Of Reading, Uk) ,  G M Megson (Univ Of Reading, Uk)
Publisher:   World Scientific Publishing Co Pte Ltd
Imprint:   World Scientific Publishing Co Pte Ltd
ISBN:  

9789810221201


ISBN 10:   9810221207
Pages:   216
Publication Date:   02 June 1999
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now