Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
From MaRDI portal
Publication:5084671
DOI10.1287/IJOC.2020.1054OpenAlexW3155985291MaRDI QIDQ5084671FDOQ5084671
Authors: Ying Zhong, Shaoxuan Liu, Jun Luo, L. Jeff Hong 
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1054
Recommendations
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Efficient ranking and selection in parallel computing environments
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- Parallel Adaptive Survivor Selection
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems
Cites Work
- Efficient ranking and selection in parallel computing environments
- Stochastic models of manufacturing systems.
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- On two-stage selection procedures and related probability-inequalities
- A fully sequential procedure for indifference-zone selection in simulation
- A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations
- Sequential selectiok procedures based on confidence sequences for normal populations
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
- A Comparison of the Asymptotic Expected Sample Sizes of Two Sequential Procedures for Ranking Problem
Cited In (4)
Uses Software
This page was built for publication: Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084671)
