Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 59,99 €!

Besplatna dostava Overseas kurirskom službom iznad 59.99 €

Overseas 4.99 € Pošta 4.99 € DPD 5.99 € GLS 3.99 € GLS paketomat 3.49 € Box Now 4.49 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 59,99 €!

Parallel Algorithms For Knapsack Type Problems

Name: Parallel Algorithms For Knapsack Type Problems
Brand: World Scientific Publishing Co Pte Ltd
SKU: 05065000
Price: 132.97 EUR
Availability: InStock

V.N. Aleksandrov

G.M. Megson

Jezik

Engleski

Knjiga Tvrdi uvez

Libristo kod: 05065000

Nakladnici World Scientific Publishing Co Pte Ltd, srpanj 1995

This text brings together current research directions in the mapping of dynamic programming problems... Cijeli opis

Libristo kod: 05065000

333 b

132.97 €

50 % šanse Pretražit ćemo cijeli svijet Kada ću dobiti knjigu?

30 dana za povrat kupljenih proizvoda

Moglo bi vas zanimati i

A Shadow in the Ember Jennifer L. Armentrout

/ Tvrdi uvez

25.31 €

Quantum Hall systems Arkadiusz Wojs

/ Tvrdi uvez

195.02 €

Telerobotic Applications Tyler Schilling

/ Tvrdi uvez

220.55 €

ATM Networks Sumit Kasera

/ Tvrdi uvez

105.12 €

Big Bend Pictures James R. Evans

/ Tvrdi uvez

60.53 €

Dylan Thomas John Ackerman

/ Meki uvez

61.44 €

Two Cartularies of Abingdon Abbey, Vol II G. Lambrick

/ Tvrdi uvez

49.03 €

Global Bankers Roy C. Smith

/ Meki uvez

38.43 €

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.

Informacije o knjizi

Puni naziv Parallel Algorithms For Knapsack Type Problems

Autor V.N. Aleksandrov, G.M. Megson

Jezik

Engleski

Uvez Knjiga - Tvrdi uvez

Datum izdanja 1995

Broj stranica 216

EAN 9789810221201

ISBN 9810221207

Libristo kod 05065000

Nakladnici World Scientific Publishing Co Pte Ltd

Kategorija

Computing & Information Technology > Computer science > Computer architecture & logic design > Parallel processing

Computing & Information Technology > Computer science > Mathematical theory of computation

Computing & Information Technology > Computer programming / software engineering

Poklonite ovu knjigu još danas

To je jednostavno

1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimca

Dostava

Savjetnik za kupnju