Randomized online algorithms for maximizing busy time interval scheduling (Q1909593): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on scheduling intervals on-line / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3128889 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized online algorithms for maximizing busy time interval scheduling |
scientific article |
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
