The computational power of simple protocols for self-awareness on graphs (Q392008)
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: The computational power of simple protocols for self-awareness on graphs |
scientific article; zbMATH DE number 6244619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational power of simple protocols for self-awareness on graphs |
scientific article; zbMATH DE number 6244619 |
Statements
The computational power of simple protocols for self-awareness on graphs (English)
0 references
13 January 2014
0 references
population protocol
0 references
diffuse computation
0 references
finite-state agent
0 references
intermittent communication
0 references
stable computation
0 references
passive mobility
0 references
graph property
0 references
self-awareness
0 references
complexity
0 references
0 references
0.8239247
0 references
0.82119715
0 references
0.8174924
0 references
0.81438583
0 references
0.8143751
0 references
