On-line selection of \(c\)-alternating subsequences from a random sample (Q1952478): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59021424, #quickstatements; #temporary_batch_1704714147019 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59021424 / rank | |||
Normal rank | |||
Revision as of 12:51, 8 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line selection of \(c\)-alternating subsequences from a random sample |
scientific article |
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
