Condizione: New. pp. 364.
Da: Revaluation Books, Exeter, Regno Unito
EUR 124,63
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. reprint edition. 368 pages. 9.25x6.10x0.83 inches. In Stock.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 74,89
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
Da: preigu, Osnabrück, Germania
EUR 68,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. An Introduction to Online Computation | Determinism, Randomization, Advice | Dennis Komm | Taschenbuch | xv | Englisch | 2018 | Springer | EAN 9783319826530 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 121,12
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 62,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Condizione: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days.
Lingua: Inglese
Editore: Springer, Springer Jun 2018, 2018
ISBN 10: 3319826530 ISBN 13: 9783319826530
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 74,89
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity. 368 pp. Englisch.
Lingua: Inglese
Editore: Springer International Publishing, 2018
ISBN 10: 3319826530 ISBN 13: 9783319826530
Da: moluna, Greven, Germania
EUR 64,33
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Particular emphasis on the paging problem and advice complexity Appropriate for undergraduate and graduate students of computer science Key feature of author s approach is focus on the information which is hidden in a given instance.
Da: Majestic Books, Hounslow, Regno Unito
EUR 111,99
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 364.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 112,13
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 364.
Lingua: Inglese
Editore: Springer, Springer Jun 2018, 2018
ISBN 10: 3319826530 ISBN 13: 9783319826530
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 74,89
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs.This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 368 pp. Englisch.