Biblioteca CRAI Dulce Chacón - Universidad Europea de Madrid

CRAI Library - Madrid
Your cart is empty.
My folder ( items) | My account
Image from Google Jackets

An Introduction to Online Computation : Determinism, Randomization, Advice / by Dennis Komm

By: Komm, Dennis
Contributor(s): SpringerLink (Online service)
Material type: materialTypeLabelE-bookSeries: (Texts in Theoretical Computer Science. An EATCS Series, 1862-4499).Publisher: Cham : Springer International Publishing, 2016Description: 1 recurso en línea (XV, 349 páginas) : 58 ilustraciones.ISBN: 9783319427492.Subject: Ordenadores | AlgoritmosDDC classification: 004.0151 Online resources: Acceso a este recurso digital (usuarios Universidad Europea de Madrid)Digital Resources
Contents:
Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.
Abstract: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Copy number Status Date due Barcode Item holds
LIBRO-E NO PRÉSTAMO LIBRO-E NO PRÉSTAMO Madrid Digital Acceso Electrónico (UEM) Ciencias e Ingeniería QA76.55 K666 2016 EB (Browse shelf(Opens below)) .i11597744 Acceso electrónico eBOOK .i11597744
Total holds: 0

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

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.

There are no comments on this title.

to post a comment.
Share