Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
From MaRDI portal
Publication:5084671
DOI10.1287/ijoc.2020.1054OpenAlexW3155985291MaRDI QIDQ5084671
Jun Luo, Ying Zhong, L. Jeff Hong, Shaoxuan Liu
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
Related Items (2)
Solving Large-Scale Fixed-Budget Ranking and Selection Problems ⋮ Efficient estimation of a risk measure requiring two-stage simulation optimization
Uses Software
Cites Work
- Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
- Sequential selectiok procedures based on confidence sequences for normal populations
- On two-stage selection procedures and related probability-inequalities
- A fully sequential procedure for indifference-zone selection in simulation
- Efficient Ranking and Selection in Parallel Computing Environments
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
- A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations
- A Comparison of the Asymptotic Expected Sample Sizes of Two Sequential Procedures for Ranking Problem
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- Unnamed Item
This page was built for publication: Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
