Muutke küpsiste eelistusi

Introduction to Online Computation: Determinism, Randomization, Advice Softcover reprint of the original 1st ed. 2016 [Pehme köide]

  • Formaat: Paperback / softback, 349 pages, kõrgus x laius: 235x155 mm, kaal: 563 g, 58 Illustrations, black and white; XV, 349 p. 58 illus., 1 Paperback / softback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 28-Jun-2018
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319826530
  • ISBN-13: 9783319826530
Teised raamatud teemal:
  • Pehme köide
  • Hind: 62,59 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 73,64 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Introduction to Online Computation: Determinism, Randomization, Advice Softcover reprint of the original 1st ed. 2016Suurem pilt
  • Formaat: Paperback / softback, 349 pages, kõrgus x laius: 235x155 mm, kaal: 563 g, 58 Illustrations, black and white; XV, 349 p. 58 illus., 1 Paperback / softback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 28-Jun-2018
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319826530
  • ISBN-13: 9783319826530
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783319826530.html

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.

Arvustused

This book is about online algorithms for optimization problems. The book can be used as a textbook on the undergraduate level. The book can also be used for self-study and as a reference. Its strength in this regard is enhanced by the historical notes at the end of each chapter and a comprehensive bibliography. (Bogdan S. Chlebus,Mathematical Reviews, March, 2018)

This text is an important contribution to the field of online algorithms. Without a doubt, this text is a must-read for anyone seriously pursuing the analysis of algorithms, particularly online versions of those algorithms. (Michael Goldberg and R. Goldberg, Computing Reviews, October, 2017)

Introduction.- Randomization.- Advice Complexity.- The k-Server Problem.- Job Shop Scheduling.- The Knapsack Problem.- The Bit Guessing Problem.- Problems on Graphs.

Dr. Dennis Komm is a lecturer in the Chair of Information Technology and Education at ETH Zürich. His research interests include approximation algorithms for hard optimization problems, re-optimization of optimization problems, and advice complexity in different setups and environments.