Approximating schedules for dynamic process graphs efficiently (Q876729)
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: Approximating schedules for dynamic process graphs efficiently |
scientific article; zbMATH DE number 5147105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating schedules for dynamic process graphs efficiently |
scientific article; zbMATH DE number 5147105 |
Statements
Approximating schedules for dynamic process graphs efficiently (English)
0 references
26 April 2007
0 references
parallel processing
0 references
dynamic process graphs
0 references
scheduling
0 references
overlap
0 references
approximation
0 references
0 references
0.7717351913452148
0 references
0.7701473236083984
0 references
