A lower bound for randomized on-line multiprocessor scheduling (Q287130): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:03, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for randomized on-line multiprocessor scheduling |
scientific article |
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
