On-line selection of \(c\)-alternating subsequences from a random sample (Q1952478)
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: On-line selection of \(c\)-alternating subsequences from a random sample |
scientific article; zbMATH DE number 6168869
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line selection of \(c\)-alternating subsequences from a random sample |
scientific article; zbMATH DE number 6168869 |
Statements
On-line selection of \(c\)-alternating subsequences from a random sample (English)
0 references
31 May 2013
0 references
Summary: A sequence \(X_1, X_2, \dots, X_n\) is a \(c\)-alternating sequence if any odd term is less than or equal to the next even term \(-c\) and if any even term is greater than or equal to the next odd term \(+c\), where \(c\) is a nonnegative constant. In this paper, we present an optimal on-line procedure to select a \(c\)-alternating subsequence from a symmetric distributed random sample. We also give the optimal selection rate when the sample size goes to infinity.
0 references