Online-bounded analysis (Q1617274): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2737179428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the influence of lookahead in competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair versus unrestricted bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line machine covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new measure for the study of on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst order ratio for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the accommodating function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The seat reservation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accommodating Function: A Generalization of the Competitive Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: On competitive on-line paging with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sleep Management on Multiple Machines for Energy and Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for a dual version of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative dominance of paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: List factoring and relative worst order analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for bandwidth allocation on two links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating online scheduling algorithms with the relative worst order ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of maintaining frequent items of a stream / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Paging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Competitive Ratios of the Seat Reservation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank

Latest revision as of 06:43, 17 July 2024

scientific article
Language Label Description Also known as
English
Online-bounded analysis
scientific article

    Statements

    Online-bounded analysis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    online algorithms
    0 references
    quality measures
    0 references
    machine scheduling
    0 references
    bin packing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers