Pages that link to "Item:Q1359450"

The following pages link to Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems (Q1359450):

Displaying 28 items.

• A direct search method for unconstrained quantile-based simulation optimization (Q319799) (← links)
• Optimization for simulation: LAD accelerator (Q646715) (← links)
• Ordinal optimization with subset selection rule (Q700726) (← links)
• On ordinal comparison of policies in Markov reward processes (Q852153) (← 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)
• Constrained ordinal optimization -- a feasibility model based approach (Q859742) (← links)
• Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty (Q862513) (← links)
• Rates of convergence of ordinal comparison for dependent discrete event dynamic systems (Q1367783) (← links)
• Simple explanation of the no-free-lunch theorem and its implications (Q1411370) (← links)
• An efficient simulation optimization method for the generalized redundancy allocation problem (Q1681168) (← links)
• Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems (Q1718781) (← links)
• Multi-policy improvement in stochastic optimization with forward recursive function criteria (Q1771387) (← links)
• Vector ordinal optimization (Q1780585) (← links)
• On the probability of correct selection by distributed voting in stochastic optimization (Q1781871) (← 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)
• Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization (Q1926785) (← 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)
• Multi-objective ordinal optimization for simulation optimization problems (Q2470041) (← links)
• A new approach to discrete stochastic optimization problems (Q2488904) (← links)
• A general framework on the simulation-based optimization under fixed computing budget (Q2503253) (← links)
• Selecting a Good Stochastic System for the Large Number of Alternatives (Q2905732) (← links)
• Sensitivity Ranks by Monte Carlo (Q5117936) (← links)
• Online surrogate problem methodology for stochastic discrete resource allocation problem. (Q5929419) (← links)
• Convergence rate analysis for optimal computing budget allocation algorithms (Q6110297) (← links)