A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920)
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: A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS |
scientific article; zbMATH DE number 2158080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS |
scientific article; zbMATH DE number 2158080 |
Statements
A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (English)
0 references
18 April 2005
0 references
real-time system
0 references
polynomial time algorithm
0 references
hierarchical optimization problem
0 references
0 references
0.8943835496902466
0 references
0.8842757940292358
0 references
0.8663381934165955
0 references
0.8196845650672913
0 references
0.813311755657196
0 references
