Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483)
From MaRDI portal
!
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 7654491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Round-competitive algorithms for uncertainty problems with parallel queries |
scientific article; zbMATH DE number 7654491 |
Statements
Round-competitive algorithms for uncertainty problems with parallel queries (English)
0 references
16 February 2023
0 references
online algorithms
0 references
competitive analysis
0 references
explorable uncertainty
0 references
parallel algorithms
0 references
minimum problem
0 references
selection problem
0 references
sorting problem
0 references
0.7904071807861328
0 references
0.7859423756599426
0 references
0.776919960975647
0 references
0.7630940079689026
0 references
