Trade-offs between selection complexity and performance when searching the plane without communication (Q2943625): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Nancy A. Lynch / rank | |||
| Property / author | |||
| Property / author: Nancy A. Lynch / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029568832 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1405.1688 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:07, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trade-offs between selection complexity and performance when searching the plane without communication |
scientific article |
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
