A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
DOI10.1109/9.533692zbMATH Open0868.93067OpenAlexW2165138637MaRDI QIDQ4896799FDOQ4896799
Authors: Chun-Hung Chen
Publication date: 1996
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.533692
Recommendations
simulationordinal optimizationdiscrete-event dynamic systemsconfidence probabilitybest designsubset selection probability
Stochastic systems and control (93E99) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cited In (22)
- Fully sequential procedures for comparing constrained systems via simulation
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Variance estimation and ranking of target tracking position errors modeled using Gaussian mixture distributions
- A probabilistic solution-generator for simulation
- Simulation optimization: a review of algorithms and applications
- An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization
- Top-\(\kappa\) selection with pairwise comparisons
- Two‐stage computing budget allocation approach for the response surface method
- Chance constrained selection of the best
- Ordinal optimization approach to rare event probability problems
- A combined statistical selection procedure measured by the expected opportunity cost
- Pareto set estimation with guaranteed probability of correct selection
- Selecting a good stochastic system for the large number of alternatives
- Selection procedures for simulations with multiple constraints under independent and correlated sampling
- Asymptotic optimality of myopic ranking and selection procedures
- On lattice event probabilities for Levin-Robbins-Leu subset selection procedures
- Simulation optimization: a review and exploration in the new era of cloud computing and big data
- Methods for System Selection Based on Sequential Mean–Variance Analysis
- Ranking and selection for pairwise comparison
- Characterization of demand for short life-cycle technology products
- Online optimization of replacement policies using learning automata
- A unified framework for stochastic optimization
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)