Pages that link to "Item:Q5169506"
From MaRDI portal
The following pages link to Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem (Q5169506):
Displaying 5 items.
- Asymptotics and renewal approximation in the online selection of increasing subsequence (Q2040096) (← links)
- A central limit theorem for temporally nonhomogenous Markov chains with applications to dynamic programming (Q2833111) (← links)
- Markov Decision Problems Where Means Bound Variances (Q2931706) (← links)
- Online Selection of Alternating Subsequences from a Random Sample (Q3108479) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)