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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: 7bc6ac3245ca9a2dd9db7ef509797ce6
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 9783319427478
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: 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. Nº de ref. del artículo: 122471191
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 349. Nº de ref. del artículo: 26375557860
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 349. Nº de ref. del artículo: 370487611
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 349. Nº de ref. del artículo: 18375557870
Cantidad disponible: 4 disponibles
Librería: preigu, Osnabrück, Alemania
Buch. Condición: Neu. An Introduction to Online Computation | Determinism, Randomization, Advice | Dennis Komm | Buch | xv | Englisch | 2016 | Springer | EAN 9783319427478 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 107858144
Cantidad disponible: 5 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 9783319427478
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: 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. Nº de ref. del artículo: 9783319427478
Cantidad disponible: 1 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA77333194274746
Cantidad disponible: 1 disponibles