Searching without communicating: tradeoffs between performance and selection complexity (Q2401119)
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 6767415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching without communicating: tradeoffs between performance and selection complexity |
scientific article; zbMATH DE number 6767415 |
Statements
Searching without communicating: tradeoffs between performance and selection complexity (English)
0 references
31 August 2017
0 references
distributed algorithms
0 references
biology-inspired algorithms
0 references
search algorithms
0 references
Markov chains
0 references
0 references
0.9498668909072876
0 references
0.7869135141372681
0 references
0.755759060382843
0 references
0.7479337453842163
0 references
