Pages that link to "Item:Q491928"
From MaRDI portal
The following pages link to Optimal online selection of a monotone subsequence: a central limit theorem (Q491928):
Displaying 17 items.
- A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length (Q556644) (← links)
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length (Q1854796) (← links)
- On-line selection of \(c\)-alternating subsequences from a random sample (Q1952478) (← 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)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- Asymptotic expansions and strategies in the online increasing subsequence problem (Q2230576) (← links)
- On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
- Sequential selection of an increasing subsequence from a random sample with geometrically distributed sample-size (Q2759600) (← 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)
- Online Selection of Alternating Subsequences from a Random Sample (Q3108479) (← links)
- An adaptive <i>O</i>(log <i>n</i>)‐optimal policy for the online selection of a monotone subsequence from a random sample (Q4601440) (← links)
- Online Scheduling with Increasing Subsequence Serving Constraint (Q4632179) (← links)
- On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
