A. Auger, M. Jebalia, and O. Teytaud, Xse: quasirandom mutations for evolution strategies, Proceedings of EA'2005, pp.12-21, 2005.

T. Bäck, F. Hoffmeister, and H. Schwefel, A survey of evolution strategies, Proceedings of the 4 th International Conference on Genetic Algorithms, pp.2-9, 1991.

T. Bäck, G. Rudolph, and H. Schwefel, Evolutionary programming and evolution strategies: Similarities and differences, Proceedings of the 2 nd Annual Conference on Evolutionary Programming, pp.11-22, 1993.

T. Bäck and M. Schütz, Evolution strategies for mixed-integer optimization of optical multilayer systems, Proceedings of the 4 th Annual Conference on Evolutionary Programming, 1995.

D. Bertsekas, Dynamic Programming and Optimal Control, vols I and II, 1995.

D. Bertsekas and J. Tsitsiklis, Neuro-dynamic programming , athena scientific, 1996.

H. Beyer, The Theory of Evolutions Strategies, 2001.
DOI : 10.1007/978-3-662-04378-3

H. Beyer, M. Olhofer, and B. Sendhoff, On the impact of systematic noise on the evolutionary optimization performance -a sphere model analysis, genetic programming and evolvable machines, pp.327-360, 2004.

C. G. Broyden, The convergence of a class of double-rank minimization algorithms 2, the new algorithm . j. of the inst. for math. and applications, pp.222-231, 1970.

R. Byrd, P. Lu, J. Nocedal, and C. Zhu, A limited memory algorithm for bound constrained optimization, SIAM J. Scientific Computing, vol.16, issue.5, 1995.

C. Cervellera and M. Muselli, A Deterministic Learning Approach Based on Discrepancy, Proceedings of WIRN'03, pp.53-60, 2003.
DOI : 10.1007/978-3-540-45216-4_5

R. Collobert and S. Bengio, Svmtorch: Support vector machines for large-scale regression problems, Journal of Machine Learning Research, vol.1, pp.143-160, 2001.

K. A. Dejong, Are genetic algorithms function optimizers ?, Proceedings of the 2 nd Conference on Parallel Problems Solving from Nature, pp.3-13, 1992.

J. Fitzpatrick and J. Grefenstette, Genetic algorithms in noisy environments, in machine learning: Special issue on genetic algorithms, 1988.

R. Fletcher, A new approach to variable metric algorithms, The Computer Journal, vol.13, issue.3, pp.317-322, 1970.
DOI : 10.1093/comjnl/13.3.317

C. Gagné, Openbeagle 3.1.0-alpha, 2005.

S. Gelly, S. Ruette, and O. Teytaud, Comparisonbased algorithms: worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in eda, and implementations with billiards, PPSN-BTP workshop, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00112813

D. Goldfarb, A family of variable-metric algorithms derived by variational means. mathematics of computation, pp.23-26, 1970.

N. Hansen and A. Ostermeier, Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation, Proceedings of IEEE International Conference on Evolutionary Computation, pp.312-317, 1996.
DOI : 10.1109/ICEC.1996.542381

F. J. Hickernell, A generalized discrepancy and quadrature error bound, Mathematics of Computation of the American Mathematical Society, vol.67, issue.221, pp.299-322, 1998.
DOI : 10.1090/S0025-5718-98-00894-1

R. Hooke and T. A. Jeeves, `` Direct Search'' Solution of Numerical and Statistical Problems, Journal of the ACM, vol.8, issue.2, pp.212-229, 1961.
DOI : 10.1145/321062.321069

Y. Jin and J. Branke, Evolutionary Optimization in Uncertain Environments???A Survey, ieee transactions on evolutionary computation, pp.303-317, 2005.
DOI : 10.1109/TEVC.2005.846356

A. F. Kaupe, Algorithm 178: direct search, Communications of the ACM, vol.6, issue.6, pp.313-314, 1963.
DOI : 10.1145/366604.366632

M. Keijzer, J. J. Merelo, G. Romero, and M. Schoenauer, Evolving Objects: A General Purpose Evolutionary Computation Library, Artificial Evolution, pp.231-244, 2001.
DOI : 10.1007/3-540-46033-0_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.422

S. M. Lavalle, M. S. Branicky, and S. R. Lindemann, On the Relationship between Classical Grid Search and Probabilistic Roadmaps, The International Journal of Robotics Research, vol.23, issue.7-8, pp.673-692, 2004.
DOI : 10.1177/0278364904045481

L. 'ecuyer, P. Lemieux, and C. , Recent advances in randomized quasi-monte carlo methods, pp.419-474, 2002.

S. R. Lindemann and S. M. Lavalle, Incremental low-discrepancy lattice methods for motion planning, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), pp.2920-2927, 2003.
DOI : 10.1109/ROBOT.2003.1242039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.7406

H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, 1992.
DOI : 10.1137/1.9781611970081

A. Owen, Quasi-Monte Carlo Sampling, A Chapter, 2003.

B. Sendhoff, H. Beyer, and M. Olhofer, The influence of stochastic quality functions on evolutionary search, in recent advances in simulated evolution and learning, ser. advances in natural computation, pp.152-172, 2004.

D. F. Shanno, Conditioning of quasi-newton methods for function minimization. mathematics of computation, pp.647-656, 1970.

I. Sloan and H. Wo´zniakowskiwo´zniakowski, When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?, Journal of Complexity, vol.14, issue.1, pp.1-33, 1998.
DOI : 10.1006/jcom.1997.0463
URL : http://doi.org/10.1006/jcom.1997.0463

R. Sutton and A. Barto, Reinforcement Learning: An Introduction, IEEE Transactions on Neural Networks, vol.9, issue.5, 1998.
DOI : 10.1109/TNN.1998.712192

S. Tsutsui, A comparative study on the effects of adding perturbations to phenotypic parameters in genetic algorithms with a robust solution searching scheme, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028), pp.585-591, 1999.
DOI : 10.1109/ICSMC.1999.823278

B. Tuffin, On the use of low discrepancy sequences in Monte Carlo methods, Monte Carlo Methods and Applications, vol.2, issue.4, 1996.
DOI : 10.1515/mcma.1996.2.4.295

G. Wasilkowski and H. Wozniakowski, The exponent of discrepancy is at most 1.4778..., Mathematics of Computation, vol.66, issue.219, pp.1125-1132, 1997.
DOI : 10.1090/S0025-5718-97-00824-7

M. Wright, Direct search methods: Once scorned, now respectable Numerical Analysis, Pitman Research Notes in Mathematics, pp.191-208, 1995.

C. Zhu, R. Byrd, P. Lu, and J. Nocedal, L-BFGS-B: a limited memory FORTRAN code for solving bound constrained optimization problems, 1994.