Knowledge state algorithms (Q548658)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5915200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Knowledge state algorithms |
scientific article; zbMATH DE number 5915200 |
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
0.8396373987197876
0 references
0.8390294909477234
0 references
0.8375572562217712
0 references
0.8305902481079102
0 references
0.8295077681541443
0 references
