Pages that link to "Item:Q3128420"
From MaRDI portal
The following pages link to The coupon-collector problem revisited — a survey of engineering problems and computational methods (Q3128420):
Displayed 14 items.
- Optimal strategy of coupon subset collection when each package contains half of the coupons (Q402372) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Image segmentation on a quantum computer (Q501145) (← links)
- Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (Q716749) (← links)
- Optimal sampling strategies in the coupon collector's problem with unknown population size (Q889554) (← links)
- On the best case performance of hit and run methods for detecting necessary constraints (Q1186280) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
- The Coupon Collector's Problem Revisited: Asymptotics of the Variance (Q2879912) (← links)
- New Results on a Generalized Coupon Collector Problem Using Markov Chains (Q2949845) (← links)
- The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp (Q2954242) (← links)
- Optimization results for a generalized coupon collector problem (Q3188594) (← links)
- Probabilistic algorithms for extreme point identification (Q3508860) (← links)
- A Collector's Problem with Renewal Arrival Processes (Q3535624) (← links)
- The Siblings of the Coupon Collector (Q4580423) (← links)