|
Avtomatika i Telemekhanika, 2013, Issue 4, Pages 91–109
(Mi at4976)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Stochastic Systems, Queuing Systems
On properties of the algorithm for pursuing a drifting quantile
E. N. Belitser, P. Serra Eindhoven University of Technology, Eindhoven, Netherlands
Abstract:
The recurrent algorithm for pursuing a time-varying (“drifting”) quantile is suggested. The common nonasymptotic upper bound of the algorithm quality is established, which is then used in a few examples of the conditions for the quantile drift function. Estimates of the degree (rate) of convergence of the algorithm for the considered examples are obtained.
Citation:
E. N. Belitser, P. Serra, “On properties of the algorithm for pursuing a drifting quantile”, Avtomat. i Telemekh., 2013, no. 4, 91–109; Autom. Remote Control, 74:4 (2013), 613–627
Linking options:
https://www.mathnet.ru/eng/at4976 https://www.mathnet.ru/eng/at/y2013/i4/p91
|
Statistics & downloads: |
Abstract page: | 329 | Full-text PDF : | 51 | References: | 66 | First page: | 28 |
|