Pages that link to "Item:Q2795876"
From MaRDI portal
The following pages link to Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments (Q2795876):
Displaying 27 items.
- A multi-objective selection procedure of determining a Pareto set (Q1000971) (← links)
- Simulation budget allocation for simultaneously selecting the best and worst subsets (Q1680908) (← links)
- A unified framework for stochastic optimization (Q1719609) (← links)
- Bayesian sequential data collection for stochastic simulation calibration (Q1735194) (← links)
- An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints (Q1737808) (← links)
- Sensitivity and covariance in stochastic complementarity problems with an application to north American natural gas markets (Q1754301) (← links)
- Distributed simulation: state-of-the-art and potential for operational research (Q1991248) (← links)
- Efficient estimation of a risk measure requiring two-stage simulation optimization (Q2103034) (← links)
- Optimal budget allocation policy for tabu search in stochastic simulation optimization (Q2108143) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- A rank-based approach to the sequential selection and assignment problem (Q2503101) (← links)
- Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee (Q2661587) (← links)
- Efficient Ranking and Selection in Parallel Computing Environments (Q4604911) (← links)
- Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments (Q5031020) (← links)
- On parallel policies for ranking and selection problems (Q5036417) (← links)
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems (Q5060777) (← links)
- Ranking and Selection with Covariates for Personalized Decision Making (Q5084611) (← links)
- Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination (Q5084669) (← links)
- Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing (Q5084671) (← links)
- Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures (Q5087734) (← links)
- Selecting the Best Simulated System: Thinking Differently About an Old Problem (Q5117921) (← links)
- Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure (Q5149555) (← links)
- Information theory for ranking and selection (Q6093553) (← links)
- Using cache or credit for parallel ranking and selection (Q6599359) (← links)
- Ranking and selection: a new sequential Bayesian procedure for use with common random numbers (Q6600037) (← links)
- Predicting the simulation budget in ranking and selection procedures (Q6600058) (← links)
- Marginal improvement procedures for top-\(m\) selection (Q6632511) (← links)
