On parallel policies for ranking and selection problems
From MaRDI portal
Recommendations
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Efficient ranking and selection in parallel computing environments
- Refined knowledge-gradient policy for learning probabilities
- Hierarchical knowledge gradient for sequential sampling
- A Knowledge-Gradient Policy for Sequential Information Collection
Cites work
- A Knowledge-Gradient Policy for Sequential Information Collection
- Consistency of sequential Bayesian sampling policies
- Constrained Bayesian optimization with noisy experiments
- Efficient ranking and selection in parallel computing environments
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- scientific article; zbMATH DE number 6433488 (Why is no real title available?)
- Parallel Bayesian global optimization of expensive functions
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- The theory of the design of experiments
Cited in
(8)- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- scientific article; zbMATH DE number 5823899 (Why is no real title available?)
- Efficient ranking and selection in parallel computing environments
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- Selecting the Best Simulated System: Thinking Differently About an Old Problem
- Ranking policies in discrete Markov decision processes
- Using cache or credit for parallel ranking and selection
- Simulation budget allocation for improving scheduling and routing of automated guided vehicles in warehouse management
This page was built for publication: On parallel policies for ranking and selection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036417)
