The following pages link to Ordinal optimization of DEDS (Q1198421):
Displaying 47 items.
- Subset selection of best simulated systems (Q357960) (← links)
- A revisit of two-stage selection procedures (Q531448) (← links)
- Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
- Continuous optimization via simulation using golden region search (Q621655) (← links)
- Optimization for simulation: LAD accelerator (Q646715) (← links)
- Ordinal optimization with subset selection rule (Q700726) (← links)
- Generalized surrogate problem methodology for online stochastic discrete optimization (Q700765) (← links)
- Infinitesimal perturbation analysis and optimization for make-to-stock manufacturing systems based on stochastic fluid models (Q853683) (← links)
- Particle swarm optimization for function optimization in noisy environment (Q856065) (← links)
- An illustrative case study on application of learning based ordinal optimization approach to complex deterministic problem (Q858354) (← links)
- Ordinal optimization and quantification of heuristic designs (Q977007) (← links)
- Optimal allocation of simulation experiments in discrete stochastic optimization and approximative algorithms (Q1278957) (← links)
- Universal alignment probabilities and subset selection for ordinal optimization (Q1357520) (← links)
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems (Q1359450) (← links)
- A combined statistical selection procedure measured by the expected opportunity cost (Q1640622) (← links)
- Simulation budget allocation for simultaneously selecting the best and worst subsets (Q1680908) (← links)
- Classification of multivariate time series and structured data using constructive induction (Q1774584) (← links)
- Vector ordinal optimization (Q1780585) (← links)
- Sensitivity analysis and optimization of stochastic Petri nets (Q1801469) (← links)
- Optimization via simulation: A review (Q1805482) (← links)
- Constraint ordinal optimization (Q1810456) (← links)
- An explanation of ordinal optimization: Soft computing for hard problems (Q1818951) (← links)
- A probabilistic solution-generator for simulation (Q1869509) (← links)
- Massively parallel SIMD simulation of Markovian DEDS: Event and time synchronous methods (Q1901407) (← links)
- Parallel simulation of DEDS via event synchronization (Q1901408) (← links)
- Parallel sample path generation for discrete event systems and the traffic smoothing problem (Q1901409) (← links)
- Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks (Q1901413) (← links)
- Ordinal optimization approach to rare event probability problems (Q1901415) (← links)
- Variance reduction algorithms for parallel replicated simulation of uniformized Markov chains (Q1916033) (← links)
- Genetic algorithms with noisy fitness (Q1922199) (← links)
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates (Q1956018) (← links)
- Stochastic comparison algorithm for discrete optimization with estimation of time-varying objective functions (Q1969465) (← links)
- Comparison with a standard via all-pairwise comparisons (Q2256884) (← links)
- The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems (Q2256885) (← links)
- Efficient simulation budget allocation for ranking the top \(m\) designs (Q2320691) (← links)
- An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization (Q2348379) (← links)
- Multi-objective ordinal optimization for simulation optimization problems (Q2470041) (← links)
- Comparison of selection rules for ordinal optimization (Q2473192) (← links)
- A general framework on the simulation-based optimization under fixed computing budget (Q2503253) (← links)
- Stochastic comparison algorithm for continuous optimization with estimation (Q2564165) (← links)
- Ordinal Optimization with Computing Budget Allocation for Selecting an Optimal Subset (Q2809316) (← links)
- Selecting a Good Stochastic System for the Large Number of Alternatives (Q2905732) (← links)
- The most likely path on series-parallel networks (Q3113510) (← links)
- (Q3383984) (← links)
- An ordinal optimization based evolution strategy to schedule complex make-to-order products (Q3430256) (← links)
- Asymptotic optimality of myopic ranking and selection procedures (Q6109037) (← links)
- Convergence rate analysis for optimal computing budget allocation algorithms (Q6110297) (← links)