Trade-offs between selection complexity and performance when searching the plane without communication (Q2943625)
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 6478411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trade-offs between selection complexity and performance when searching the plane without communication |
scientific article; zbMATH DE number 6478411 |
Statements
Trade-offs between selection complexity and performance when searching the plane without communication (English)
0 references
3 September 2015
0 references
Markov chains
0 references
biology-inspired algorithms
0 references
distributed algorithms
0 references
mobile agents
0 references
search algorithms
0 references
0.9498668909072876
0 references
0.7676773071289062
0 references
0.7254291772842407
0 references
0.6974493861198425
0 references
