An Introduction to Online Computation Determinism, Randomization, Advice /
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 prob...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
Σειρά: | Texts in Theoretical Computer Science. An EATCS Series,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Περίληψη: | 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. |
---|---|
Φυσική περιγραφή: | XV, 349 p. 58 illus. online resource. |
ISBN: | 9783319427492 |
ISSN: | 1862-4499 |