Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand (Q5089126)
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 7559354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand |
scientific article; zbMATH DE number 7559354 |
Statements
18 July 2022
0 references
generalized multiframe task model (GMF)
0 references
generalized multiframe task model with parameter adaptation (GMF-PA)
0 references
self-suspending tasks
0 references
uniprocessor scheduling
0 references
mixed-integer linear programming
0 references
concave approximation
0 references
linear programming
0 references
Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand (English)
0 references
0.7943419
0 references
0.78868365
0 references
0.78839165
0 references
0.7877374
0 references
0.78720045
0 references
0.7866428
0 references
