A new myopic sequential sampling algorithm for multi-objective problems
暂无分享,去创建一个
[1] Jürgen Branke,et al. Selecting a Selection Procedure , 2007, Manag. Sci..
[2] Bernard Manderick,et al. Knowledge Gradient for Multi-objective Multi-armed Bandit Algorithms , 2014, ICAART.
[3] Georgios C. Anagnostopoulos,et al. S-Race: a multi-objective racing algorithm , 2013, GECCO '13.
[4] Loo Hay Lee,et al. Computing budget allocation rules for multi-objective simulation models based on different measures of selection quality , 2010, Autom..
[5] F. Al-Shamali,et al. Author Biographies. , 2015, Journal of social work in disability & rehabilitation.
[6] Alireza Kabirian,et al. Selection of the best with stochastic constraints , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).
[7] L. Lee,et al. Finding the non-dominated Pareto set for multi-objective simulation models , 2010 .
[8] Chun-Hung Chen,et al. Efficient simulation budget allocation for selecting the best set of simplest good enough designs , 2010, Proceedings of the 2010 Winter Simulation Conference.
[9] Jürgen Branke,et al. Sequential Sampling to Myopically Maximize the Expected Value of Information , 2010, INFORMS J. Comput..
[10] M. Degroot. Optimal Statistical Decisions , 1970 .
[11] Loo Hay Lee,et al. Integration of indifference-zone with multi-objective computing budget allocation , 2010, Eur. J. Oper. Res..
[12] Loo Hay Lee,et al. Stochastic Simulation Optimization - An Optimal Computing Budget Allocation , 2010, System Engineering and Operations Research.
[13] Chun-Hung Chen,et al. Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..
[14] Marc Schoenauer,et al. Racing Multi-objective Selection Probabilities , 2014, PPSN.