On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks (Q1796441)
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: On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks |
scientific article; zbMATH DE number 6957309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks |
scientific article; zbMATH DE number 6957309 |
Statements
On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks (English)
0 references
17 October 2018
0 references
0.9359592199325562
0 references
0.7447642683982849
0 references
0.7398810386657715
0 references
0.7351828217506409
0 references
0.733094334602356
0 references
