Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (Q5387786)
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 5279479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster Treasure Hunt and Better Strongly Universal Exploration Sequences |
scientific article; zbMATH DE number 5279479 |
Statements
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences (English)
0 references
27 May 2008
0 references
design and analysis of algorithms
0 references
distributed computing
0 references
networks
0 references
rendezvous
0 references
strongly universal exploration sequences
0 references
0.8878066539764404
0 references
0.887349009513855
0 references
0.7688711285591125
0 references
0.7327950596809387
0 references
0.7250245213508606
0 references
