Pages that link to "Item:Q4954239"
From MaRDI portal
The following pages link to Sequential selection of an increasing subsequence from a sample of random size (Q4954239):
Displaying 16 items.
- Optimal online selection of a monotone subsequence: a central limit theorem (Q491928) (← links)
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length (Q1854796) (← links)
- Comparison of sequential experiments (Q1922417) (← links)
- The BRS-inequality and its applications (Q2039762) (← links)
- Asymptotics and renewal approximation in the online selection of increasing subsequence (Q2040096) (← links)
- Diffusion approximations in the online increasing subsequence problem (Q2048141) (← links)
- On sequential selection and a first passage problem for the Poisson process (Q2064843) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- Asymptotic expansions and strategies in the online increasing subsequence problem (Q2230576) (← links)
- Quickest online selection of an increasing subsequence of specified size (Q2820269) (← links)
- Sequential selection of a monotone subsequence from a random permutation (Q2821757) (← links)
- Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence (Q3103629) (← links)
- Online Selection of Alternating Subsequences from a Random Sample (Q3108479) (← links)
- A full-information best-choice problem with finite memory (Q3753199) (← links)
- Adaptive sequential selection procedures with random subset sizes (Q4596536) (← links)
- Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem (Q5169506) (← links)