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.
€70.60
Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● ISBN 9783319427492 ● Editura Springer International Publishing ● Publicat 2016 ● Descărcabil 3 ori ● Valută EUR ● ID 6303932 ● Protecție împotriva copiilor Adobe DRM
Necesită un cititor de ebook capabil de DRM
Mai multe cărți electronice de la același autor (i) / Editor
49.653 Ebooks din această categorie
