Pages that link to "Item:Q3893303"
From MaRDI portal
The following pages link to An Efficient Method for Weighted Sampling without Replacement (Q3893303):
Displaying 15 items.
- Practical algorithms for generating a random ordering of the elements of a weighted set (Q489756) (← links)
- Weighted sampling without replacement from data streams (Q495669) (← links)
- Moment preserving constrained resampling with applications to particle-in-cell methods (Q778280) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Weighted random sampling with a reservoir (Q1045927) (← links)
- Bounding the variance in Monte Carlo experiments (Q1197912) (← links)
- Robust active learning with binary responses (Q2123274) (← links)
- Dynamic sampling from a discrete probability distribution with a known distribution of rates (Q2155015) (← links)
- A general result for selecting balanced unequal probability samples from a stream (Q2328310) (← links)
- Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems (Q2427318) (← links)
- A method to reduce the rejection rate in Monte Carlo Markov chains (Q3302990) (← links)
- The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms (Q4950714) (← links)
- (Q4969090) (← links)
- Parallel Weighted Random Sampling (Q5075804) (← links)
- Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845) (← links)