Cantitate/Preț
Produs
Total produse
Vezi coșul
An Introduction to Online Computation: Determinism, Randomization, Advice de Dennis Komm

An Introduction to Online Computation: Determinism, Randomization, Advice: Texts in Theoretical Computer Science. An EATCS Series

Autor Dennis Komm
en Limba Engleză Hardback – 10 noi 2016
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 39814 lei  39-44 zile
  Springer International Publishing – 28 iun 2018 39814 lei  39-44 zile
Hardback (1) 94250 lei  39-44 zile
  Springer International Publishing – 10 noi 2016 94250 lei  39-44 zile

Din seria Texts in Theoretical Computer Science. An EATCS Series

Preț: 94250 lei

Preț vechi: 117813 lei
-20% Nou

Puncte Express: 1414
Preț estimativ în valută:
18038€ • 19029$ • 15032£

Carte tipărită la comandă

Livrare economică 30 decembrie 24 - 04 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319427478
ISBN-10: 3319427474
Pagini: 359
Ilustrații: XV, 349 p. 58 illus.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 6.74 kg
Ediția:1st ed. 2016
Editura: Springer International Publishing
Colecția Springer
Seria Texts in Theoretical Computer Science. An EATCS Series

Locul publicării:Cham, Switzerland

Cuprins

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

Recenzii

“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)

Notă biografică

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.

Textul de pe ultima copertă

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.

Caracteristici

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 Includes supplementary material: sn.pub/extras