Real time scheduling with a budget: parametric-search is better than binary search (Q845717)
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: Real time scheduling with a budget: parametric-search is better than binary search |
scientific article; zbMATH DE number 5664482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Real time scheduling with a budget: parametric-search is better than binary search |
scientific article; zbMATH DE number 5664482 |
Statements
Real time scheduling with a budget: parametric-search is better than binary search (English)
0 references
29 January 2010
0 references
parametric-search method
0 references
approximation algorithms
0 references
