Knowledge state algorithms (Q548658): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Gunther Schmidt / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5915200 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
online algorithms | |||
Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
competitive analysis | |||
Property / zbMATH Keywords: competitive analysis / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
randomization | |||
Property / zbMATH Keywords: randomization / rank | |||
Normal rank |
Revision as of 13:03, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Knowledge state algorithms |
scientific article |
Statements
Knowledge state algorithms (English)
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
online algorithms
0 references
competitive analysis
0 references
randomization
0 references