How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations (Q5397696)
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 6261122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations |
scientific article; zbMATH DE number 6261122 |
Statements
How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations (English)
0 references
24 February 2014
0 references
periodic scheduling
0 references
linear programming
0 references
storage constraints
0 references
register constraints
0 references
code optimisation
0 references
0.7279626727104187
0 references
0.7065457105636597
0 references
0.6963056325912476
0 references
0.6867580413818359
0 references
