A lower bound for randomized on-line multiprocessor scheduling (Q287130)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound for randomized on-line multiprocessor scheduling |
scientific article; zbMATH DE number 6585441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for randomized on-line multiprocessor scheduling |
scientific article; zbMATH DE number 6585441 |
Statements
A lower bound for randomized on-line multiprocessor scheduling (English)
0 references
26 May 2016
0 references
combinatorial problems
0 references
online algorithms
0 references
randomization
0 references
scheduling
0 references
worst-case bounds
0 references
0 references
0.9245061874389648
0 references
0.923206627368927
0 references
0.8841367363929749
0 references
0.8808220624923706
0 references
0.8808220624923706
0 references
