Pages that link to "Item:Q2809316"
From MaRDI portal
The following pages link to Ordinal optimization with computing budget allocation for selecting an optimal subset (Q2809316):
Displaying 14 items.
- Subset selection of best simulated systems (Q357960) (← links)
- Using ordinal optimization approach to improve efficiency of selection procedures (Q702838) (← links)
- Integration of indifference-zone with multi-objective computing budget allocation (Q1046117) (← links)
- Universal alignment probabilities and subset selection for ordinal optimization (Q1357520) (← links)
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization (Q1581038) (← 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)
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems (Q1718781) (← links)
- An explanation of ordinal optimization: Soft computing for hard problems (Q1818951) (← links)
- Selecting a Good Stochastic System for the Large Number of Alternatives (Q2905732) (← links)
- Selecting the best system using the three-stage and the four-stage selection approaches (Q2910406) (← links)
- (Q3383984) (← links)
- Tractable Sampling Strategies for Ordinal Optimization (Q5131546) (← links)
- Convergence rate analysis for optimal computing budget allocation algorithms (Q6110297) (← links)
