摘要：A solution to the ranking and selection problem of determining a subset of size 𝑚 containing at least 𝑐 of the 𝑣 best from 𝑘 normal distributions has been developed. The best distributions are those having, for example, (i) the smallest
means, or (ii) the smallest variances. This paper reviews various applicable algorithms and supplies the operating constants needed
to apply these solutions. The constants are computed using a histogram approximation algorithm and Monte Carlo integration.
