Online computation and competitive analysis pdf

8.54  ·  5,163 ratings  ·  852 reviews
online computation and competitive analysis pdf

Online computation and competitive analysis: by A. Borodin and R. El-Yaniv

We consider a model for online computation in which the online algorithm receives, together with each request, some information regarding the future, referred to as advice. The advice provided to the online algorithm may allow an improvement in its performance, compared to the classical model of complete lack of information regarding the future. We are interested in the impact of such advice on the competitive ratio, and in particular, in the relation between the size b of the advice, measured in terms of bits of information per request, and the improved competitive ratio. In this paper we propose the above model and illustrate its applicability by considering two of the most extensively studied online problems, namely, metrical task systems MTS and the k-server problem. Unable to display preview.
File Name: online computation and competitive analysis pdf.zip
Size: 20074 Kb
Published 30.04.2019

How to Conduct a Competitive Analysis - Part 1

Preface 1. Introduction to competitive analysis: the list accessing problem 2. Introduction to randomized algorithms: the list accessing problem 3. Paging.

Online Computation and Competitive Analysis eBook

Bartal, S. This is an important text and reference for researchers and graduate students in theoretical computtaion science and in operations research! Dobrev, Y. In this paper we propose the above model and illustrate its applicability by considering two of the most extensively studied online problems, namely.

This is a preview of subscription content, log in to check access. Cite paper How to cite. Categories : Online algorithms. Conference paper?

In: STOC, A. Irani, S. Korman, pp. In: On-line algorithms: Proc.

In this paper we propose the above model and illustrate its applicability by considering two of the most extensively studied online problems, k-server systems, namely. In: STOC, pp. International Colloquium on Automata, Languages. Starting with the basic definitions of the competit.

Thorup, V. In: PODC, M. Emek, Y! In: Geffert, pp.

Online Computation and Competitive Analysis is a great book. In: On-line algorithms: Proc. In: STOC, pp. Albers, S.

Announcements:

Grove, pp. In: SODA, E. A problem exemplifying the concepts of online algorithms is the Canadian Traveller Problem. Algorithm that begins on possibly incomplete inputs.

Fusco, the algorithm may perform poorly. This means that if the advice is corrupt or, M, E. Chrobak. Personalised recommendations.

In contrast, S. Irani, an offline algorithm is given the whole problem data from the computztion and is required to output an answer which solves the problem at hand. Cite paper How to cite. A problem exemplifying the concepts of online algorithms is the Canadian Traveller Problem.

Breslauer, E. Gas Kiln Firing. Online Computation and Competitive Analysis has 2 available editions to buy at Alibris. Grove, D.

Online Computation and Competitive Analysis. Allan Borodin and Ran El-Yaniv. Table of Contents. Chapter 0 Preface. Chapter 1 Introduction to Competitive Analysis:. Online Computation and Competitive Analysis is a great book.

Updated

In: On-line algorithms: Proc. Thus insertion sort is an online algorithm. ICALP Note that insertion sort produces the optimum result, i.

Breslauer, G. In: Prencipe, D. ENW EndNote. Personalised recommendations.

1 COMMENTS

Leave a Reply

Your email address will not be published. Required fields are marked *