Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues (Q4368705)
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: Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues |
scientific article; zbMATH DE number 1094914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues |
scientific article; zbMATH DE number 1094914 |
Statements
Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues (English)
0 references
15 January 1998
0 references
stochastic approximation
0 references
stochastic discrete-event systems
0 references
perturbation-analysis-Robbins-Monro-single-run algorithm
0 references
GI/G/1 queueing systems
0 references
0.8078440427780151
0 references
0.8049089312553406
0 references
0.7951991558074951
0 references
