Bounding the Power of Preemption in Randomized Scheduling (Q4210081): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MOCA / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:47, 5 March 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
