The dynamic team forming problem: throughput and delay for unbiased policies (Q847121)
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 dynamic team forming problem: throughput and delay for unbiased policies |
scientific article; zbMATH DE number 5669107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The dynamic team forming problem: throughput and delay for unbiased policies |
scientific article; zbMATH DE number 5669107 |
Statements
The dynamic team forming problem: throughput and delay for unbiased policies (English)
0 references
12 February 2010
0 references
dynamic vehicle routing
0 references
team/coalition forming
0 references
robotic networks
0 references
0 references
0 references
0.7126458883285522
0 references
0.6960233449935913
0 references
0.6787501573562622
0 references
0.674837052822113
0 references
0.67447829246521
0 references
