Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
From MaRDI portal
Publication:4339737
DOI10.1109/9.566675zbMath0871.93054OpenAlexW2116667068MaRDI QIDQ4339737
Publication date: 7 October 1997
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.566675
Related Items (max. 100)
Selecting a Good Stochastic System for the Large Number of Alternatives ⋮ An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem ⋮ Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems ⋮ Stochastic comparison algorithm for discrete optimization with estimation of time-varying objective functions ⋮ The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems ⋮ A general framework on the simulation-based optimization under fixed computing budget ⋮ Ordinal Optimization with Computing Budget Allocation for Selecting an Optimal Subset ⋮ An explanation of ordinal optimization: Soft computing for hard problems
This page was built for publication: Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
