A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
From MaRDI portal
Publication:4896799
Recommendations
Cited in
(21)- Chance constrained selection of the best
- Top-\(\kappa\) selection with pairwise comparisons
- Selecting a good stochastic system for the large number of alternatives
- An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization
- Variance estimation and ranking of target tracking position errors modeled using Gaussian mixture distributions
- A probabilistic solution-generator for simulation
- Ranking and selection for pairwise comparison
- Online optimization of replacement policies using learning automata
- Pareto set estimation with guaranteed probability of correct selection
- Characterization of demand for short life-cycle technology products
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Two‐stage computing budget allocation approach for the response surface method
- Methods for system selection based on sequential mean-variance analysis
- A unified framework for stochastic optimization
- Ordinal optimization approach to rare event probability problems
- Fully sequential procedures for comparing constrained systems via simulation
- Simulation optimization: a review and exploration in the new era of cloud computing and big data
- Asymptotic optimality of myopic ranking and selection procedures
- A combined statistical selection procedure measured by the expected opportunity cost
- Selection procedures for simulations with multiple constraints under independent and correlated sampling
- On lattice event probabilities for Levin-Robbins-Leu subset selection procedures
This page was built for publication: A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896799)