View in EDS PDF Full Text

BEYOND COMPETITIVE ANALYSIS.

Saved in:
Bibliographic Details
Title: BEYOND COMPETITIVE ANALYSIS.
Authors: Koutsoupias, Elias, Padadimitriou, Christos H.
Source: SIAM Journal on Computing. 2000, Vol. 30 Issue 1, p300. 18p.
Subjects: Online algorithms, Paging (Computer science), Decision making, Computer science
Abstract: The competitive analysis of online algorithms has been criticized as being too crude and unrealistic. We propose refinements of competitive analysis in two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for online decision-making. We illustrate the first with an application to the paging problem; as a byproduct we characterize completely the work functions of this important special case of the k-server problem. We use the second refinement to explore the power of lookahead in server and task systems. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 10475668
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: BEYOND COMPETITIVE ANALYSIS.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Koutsoupias%2C+Elias%22">Koutsoupias, Elias</searchLink><br /><searchLink fieldCode="AR" term="%22Padadimitriou%2C+Christos+H%2E%22">Padadimitriou, Christos H.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Computing%22">SIAM Journal on Computing</searchLink>. 2000, Vol. 30 Issue 1, p300. 18p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Online+algorithms%22">Online algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Paging+%28Computer+science%29%22">Paging (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Decision+making%22">Decision making</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science%22">Computer science</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The competitive analysis of online algorithms has been criticized as being too crude and unrealistic. We propose refinements of competitive analysis in two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for online decision-making. We illustrate the first with an application to the paging problem; as a byproduct we characterize completely the work functions of this important special case of the k-server problem. We use the second refinement to explore the power of lookahead in server and task systems. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10475668
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1137/S0097539796299540
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 300
    Subjects:
      – SubjectFull: Online algorithms
        Type: general
      – SubjectFull: Paging (Computer science)
        Type: general
      – SubjectFull: Decision making
        Type: general
      – SubjectFull: Computer science
        Type: general
    Titles:
      – TitleFull: BEYOND COMPETITIVE ANALYSIS.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Koutsoupias, Elias
      – PersonEntity:
          Name:
            NameFull: Padadimitriou, Christos H.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: 2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 00975397
          Numbering:
            – Type: volume
              Value: 30
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: SIAM Journal on Computing
              Type: main
ResultId 1