Cookie Settings

Cookies are small text files that your web browser uses to save your so-called session. We use technically necessary cookies to be able to offer a comfortable booking process. In addition, you can help us to continuously optimize the booking portal by agreeing to our analytics cookies:

Allow Cookies

Disallow Cookies

View my cookie settings

De En Es
☰
Customer Support/Contact

Cuvillier Verlag

Publications, Dissertations, Habilitations & Brochures.
International Specialist Publishing House for Science and Economy

Cuvillier Verlag

De En Es
Departments
Book Series (90)
1260
Humanities
2246
Natural Sciences
5309
Mathematics 223
Informatics 310
Physics 971
Chemistry 1346
Geosciences 130
Human medicine 241
Stomatology 10
Veterinary medicine 98
Pharmacy 147
Biology 812
Biochemistry, molecular biology, gene technology 114
Biophysics 25
Domestic and nutritional science 44
Agricultural science 992
Forest science 202
Horticultural science 18
Environmental research, ecology and landscape conservation 145
Engineering
1713
Common
91
Leitlinien Unfallchirurgie
5. Auflage bestellen
Advanced Search
Information Content of Online Problems

Hard Copy
EUR 29.80

E-book
EUR 20.50

Information Content of Online Problems (English shop)

Advice versus Determinism and Randomization

Jasmin Smula (Author)

Preview

Table of Contents, PDF (49 KB)
Extract, PDF (120 KB)

ISBN-13 (Hard Copy) 9783736990739
ISBN-13 (eBook) 9783736980730
Language English
Page Number 174
Lamination of Cover glossy
Edition 1. Aufl.
Publication Place Göttingen
Place of Dissertation Zürich
Publication Date 2015-08-11
General Categorization Dissertation
Departments Informatics
Description

In online computation, an algorithm has to solve some optimization problem while receiving the input instance gradually, without any knowledge about the future input. Such an online algorithm has to compute parts of the output for parts of the input, based on what it knows about the input so far and without being able to revoke its decisions later. Almost inevitably, the algorithm makes a bad choice at some point that leads to a solution that is suboptimal with respect to the whole input instance. Compared to an offline algorithm that is given the entire input instance at once, the online algorithm thus has a substantial handicap. Developing online algorithms that nonetheless compute solutions of some adequate quality is a large and rich field of research within computer science.