Knowledge state algorithms (Q548658): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two servers on the line. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited bookmark randomized online algorithms for the paging problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trackless online algorithms for the server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Two Servers in Cross Polytope Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on randomized on-line algorithms for caching. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank

Latest revision as of 06:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Knowledge state algorithms
scientific article

    Statements

    Knowledge state algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    The paper is concerned with constructing randomized online algorithms. The latter are able to process their input serially as the input is given and without knowing the entire input at the beginning. The authors coin the concept of a knowledge state algorithm that also covers several known types of algorithms. Optimality and competitiveness are studied.
    0 references
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    randomization
    0 references
    0 references