-
1
-
-
72749126740
-
Continuous lunches are free plus the design of optimal optimization algorithms
-
Accepted
-
A. Auger and O. Teytaud. Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica, Accepted.
-
Algorithmica
-
-
Auger, A.1
Teytaud, O.2
-
2
-
-
72749127062
-
Comparison-based algorithms: Worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in eda, and implementations with billiards
-
S. Gelly, S. Ruette, and O. Teytaud. Comparison-based algorithms: worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in eda, and implementations with billiards. In PPSN-BTP workshop, 2006.
-
(2006)
PPSN-BTP workshop
-
-
Gelly, S.1
Ruette, S.2
Teytaud, O.3
-
4
-
-
0000561424
-
Efficient global optimization of expensive black-box functions
-
D. R. Jones, M. Schonlau, and W. J. Welch. Efficient global optimization of expensive black-box functions. J. of Global Optimization, 13(4):455-492, 1998.
-
(1998)
J. of Global Optimization
, vol.13
, Issue.4
, pp. 455-492
-
-
Jones, D.R.1
Schonlau, M.2
Welch, W.J.3
-
5
-
-
33750293964
-
Bandit-based monte-carlo planning
-
L. Kocsis and C. Szepesvari. Bandit-based monte-carlo planning. In ECML'06, pages 282-293, 2006.
-
(2006)
ECML'06
, pp. 282-293
-
-
Kocsis, L.1
Szepesvari, C.2
-
6
-
-
33750226018
-
Ordinal regression in evolutionary computation
-
T.-P. Runarsson. Ordinal regression in evolutionary computation. In proceedings of PPSN, pages 1048-1057, 2006.
-
(2006)
proceedings of PPSN
, pp. 1048-1057
-
-
Runarsson, T.-P.1
-
7
-
-
56449114902
-
Lower bounds for evolution strategies using VC-dimension
-
G. Rudolph, T. Jansen, S. M. Lucas, C. Poloni, and N. Beume, editors, Springer
-
O. Teytaud and H. Fournier. Lower bounds for evolution strategies using VC-dimension. In G. Rudolph, T. Jansen, S. M. Lucas, C. Poloni, and N. Beume, editors, PPSN, volume 5199 of Lecture Notes in Computer Science, pages 102-111. Springer, 2008.
-
(2008)
PPSN, volume 5199 of Lecture Notes in Computer Science
, pp. 102-111
-
-
Teytaud, O.1
Fournier, H.2
-
8
-
-
38149070231
-
General lower bounds for evolutionary computation
-
O. Teytaud and S. Gelly. General lower bounds for evolutionary computation. In proceedings of PPSN, 2006.
-
(2006)
proceedings of PPSN
-
-
Teytaud, O.1
Gelly, S.2
-
9
-
-
72749110730
-
Global optimization based on noisy evaluations: An empirical study of two statistical approaches
-
17
-
E. Vazquez, J. Villemonteix, M. Sidorkiewicz, and E. Walter. Global optimization based on noisy evaluations: an empirical study of two statistical approaches. Journal of Global Optimization, page 17 pages, 2008.
-
(2008)
Journal of Global Optimization, page
-
-
Vazquez, E.1
Villemonteix, J.2
Sidorkiewicz, M.3
Walter, E.4
-
10
-
-
72749088669
-
-
J. Villemonteix, E. Vazquez, and E. Walter. An informational approach to the global optimization of expensive-to-evaluate functions. Journal of Global Optimization, page 26 pages, 09 2008.
-
J. Villemonteix, E. Vazquez, and E. Walter. An informational approach to the global optimization of expensive-to-evaluate functions. Journal of Global Optimization, page 26 pages, 09 2008.
-
-
-
-
11
-
-
4344634542
-
-
Z. Zhou. Hierarchical surrogate-assisted evolutionary optimization framework. In In Evolutionary Computation, 2004. CEC2004. Congress on, pages 1586-1593, 2004.
-
Z. Zhou. Hierarchical surrogate-assisted evolutionary optimization framework. In In Evolutionary Computation, 2004. CEC2004. Congress on, pages 1586-1593, 2004.
-
-
-
|