How many probes are needed to compute the maximum of a random walk? (Q1593629)
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 1554309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How many probes are needed to compute the maximum of a random walk? |
scientific article; zbMATH DE number 1554309 |
Statements
How many probes are needed to compute the maximum of a random walk? (English)
0 references
17 January 2001
0 references
average case analysis of algorithms
0 references
quasi-optimal algorithm
0 references
random walk
0 references
Brownian motion
0 references
Brownian meander
0 references
0 references
0 references
0.8103880882263184
0 references
0.8053504228591919
0 references
0.8035540580749512
0 references
0.7896142601966858
0 references
0.7376168370246887
0 references
