Using cache or credit for parallel ranking and selection
From MaRDI portal
Publication:6599359
DOI10.1145/3618299zbMATH Open1544.62005MaRDI QIDQ6599359FDOQ6599359
Recommendations
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Efficient ranking and selection in parallel computing environments
- Parallel Adaptive Survivor Selection
- On parallel policies for ranking and selection problems
- Ranking and selection for steady-state simulation: procedures and perspectives
Cites work
- A Knowledge-Gradient Policy for Sequential Information Collection
- A fully sequential procedure for indifference-zone selection in simulation
- Complete expected improvement converges to an optimal budget allocation
- Control variates for screening, selection, and estimation of the best
- Distributed web-based simulation experiments for optimization
- Efficient global optimization of expensive black-box functions
- Efficient ranking and selection in parallel computing environments
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Gaussian Markov random fields for discrete optimization via simulation: framework and algorithms
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- Myopic Allocation Policy With Asymptotically Optimal Sampling Rate
- On parallel policies for ranking and selection problems
- Selecting a selection procedure
- Simple Bayesian algorithms for best-arm identification
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
This page was built for publication: Using cache or credit for parallel ranking and selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599359)
