Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Parallel Algorithms For Knapsack Type Problems
Imagen de archivo
Parallel Algorithms for Knapsack Type Problems
Publicado por
World Scientific Publishing Company, 1999
ISBN 10: 9810221207
ISBN 13: 9789810221201
Antiguo o usado
Tapa dura
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Very Good. No Jacket. Former library book; Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G9810221207I4N11
Comprar usado
EUR 75,61
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Parallel Algorithms for Knapsack Type Problems
Publicado por
World Scientific Publishing Company, 1999
ISBN 10: 9810221207
ISBN 13: 9789810221201
Nuevo
Tapa dura
Librería: BOOKWEST, Phoenix, AZ, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: New. US SELLER SHIPS FAST FROM USA. Nº de ref. del artículo: INTOK-132E3-9810221207
Comprar nuevo
EUR 79,15
EUR 4,26 shipping
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Parallel Algorithms for Knapsack Type Problems
Publicado por
World Scientific Pub Co Inc, 1995
ISBN 10: 9810221207
ISBN 13: 9789810221201
Antiguo o usado
Tapa dura
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: Like New. Like NewLIKE NEW. book. Nº de ref. del artículo: ERICA83898102212073
Comprar usado
EUR 60,01
EUR 28,56 shipping
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles