Communication scheduling in data gathering networks with limited memory (Q272491)
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 6571182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication scheduling in data gathering networks with limited memory |
scientific article; zbMATH DE number 6571182 |
Statements
Communication scheduling in data gathering networks with limited memory (English)
0 references
20 April 2016
0 references
scheduling
0 references
data gathering networks
0 references
limited memory
0 references
divisible loads
0 references
0.8085523843765259
0 references
0.7880734205245972
0 references
0.7876825928688049
0 references
0.7794628739356995
0 references
0.777933657169342
0 references
