Approximating the throughput by coolest first scheduling (Q2848925)
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 6208094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the throughput by coolest first scheduling |
scientific article; zbMATH DE number 6208094 |
Statements
Approximating the Throughput by Coolest First Scheduling (English)
0 references
13 September 2013
0 references
0.8466699123382568
0 references
0.8220881223678589
0 references
0.816709041595459
0 references
0.8122819066047668
0 references
0.8109188079833984
0 references
