Bounding the Power of Preemption in Randomized Scheduling (Q4210081): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539795283292 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975122098 / rank | |||
Normal rank | |||
Latest revision as of 11:01, 30 July 2024
scientific article; zbMATH DE number 1200713
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
