Randomized online algorithms for maximizing busy time interval scheduling (Q1909593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Randomized online algorithms for maximizing busy time interval scheduling |
scientific article; zbMATH DE number 856612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized online algorithms for maximizing busy time interval scheduling |
scientific article; zbMATH DE number 856612 |
Statements
Randomized online algorithms for maximizing busy time interval scheduling (English)
0 references
17 March 1996
0 references
busy time
0 references
probabilistic online algorithm
0 references
0.8362808227539062
0 references
0.8329712748527527
0 references
0.8296011090278625
0 references
0.8247897028923035
0 references
0.8194898962974548
0 references
