Bounding the Power of Preemption in Randomized Scheduling (Q4210081)
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 1200713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the Power of Preemption in Randomized Scheduling |
scientific article; zbMATH DE number 1200713 |
Statements
Bounding the Power of Preemption in Randomized Scheduling (English)
0 references
20 September 1998
0 references
randomized algorithms
0 references
scheduling
0 references
preemption
0 references
lower bounds
0 references
0.90071005
0 references
0 references
0.8942498
0 references
0.89353144
0 references
0.8906245
0 references
0.8888767
0 references
0.8817274
0 references
