A. Auger, M. Jebalia, and O. Teytaud, XSE: quasi-random mutations for evolution strategies, Proceedings of Evolutionary Algorithms, p.12, 2005.

S. J. Bates, J. Sienz, and V. V. Toropov, Formulation of the Optimal Latin Hypercube Design of Experiments Using a Permutation Genetic Algorithm, 45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics & Materials Conference, 2004.
DOI : 10.2514/6.2004-2011

C. Cervellera and M. Muselli, Deterministic Design for Neural Network Learning: An Approach Based on Discrepancy, IEEE Transactions on Neural Networks, vol.15, issue.3, pp.533-544, 2004.
DOI : 10.1109/TNN.2004.824413

C. Chlier, Error trends in quasi-Monte Carlo integration, Comp. Phys. Comm, vol.193, pp.93-105, 2004.

K. Chung, An estimate concerning the Kolmogoroff limit distribution. Transactions of the, pp.36-50, 1949.

T. M. Cioppa and T. W. Lucas, Efficient Nearly Orthogonal and Space-Filling Latin Hypercubes, Technometrics, vol.49, issue.1, pp.45-55, 2007.
DOI : 10.1198/004017006000000453

T. J. Davies, R. R. Martin, and A. Bowyer, Computing Volume Properties Using Low-Discrepancy Sequences, Geometric Modelling, pp.55-72, 1999.
DOI : 10.1007/978-3-7091-6270-5_4

K. T. Fang, D. K. Lin, P. Winker, and Y. Zhang, Uniform Design: Theory and Application, Technometrics, vol.34, issue.3, pp.237-248, 2000.
DOI : 10.1016/0167-9473(94)00041-G

K. T. Fang and Y. Wang, Number-theoretic Methods in Statistics, 1994.
DOI : 10.1007/978-1-4899-3095-8

A. Florian, An efficient sampling scheme: Updated Latin Hypercube Sampling, Probabilistic engineering mechanics, pp.123-130, 1992.
DOI : 10.1016/0266-8920(92)90015-A

C. Gagné and M. Parizeau, GENERICITY IN EVOLUTIONARY COMPUTATION SOFTWARE TOOLS: PRINCIPLES AND CASE-STUDY, International Journal on Artificial Intelligence Tools, vol.15, issue.02, pp.173-194, 2006.
DOI : 10.1142/S021821300600262X

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

M. Liefvendahl and R. Stocki, A study on algorithms for optimization of Latin hypercubes, Journal of Statistical Planning and Inference, vol.136, issue.9, pp.3231-3247, 2006.
DOI : 10.1016/j.jspi.2005.01.007

M. Lizotte, D. Poussart, F. Bernier, M. Mokhtari, E. Boivin et al., IMAGE: Simulation for understanding complex situations and increasing future force agility, Proceedings of the 26th Army Science Conference, p.7, 2008.

M. D. Mckay, R. J. Beckman, and W. J. Conover, A comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics, vol.21, issue.2, pp.239-245, 1979.

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

A. B. Owen, Quasi-Monte Carlo sampling, Monte Carlo Ray Tracing: Siggraph 2003 Course 44, pp.69-88, 2003.

I. H. 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

K. S. Tan and P. P. Boyle, Applications of randomized low discrepancy sequences to the valuation of complex securities, Journal of Economic Dynamics and Control, vol.24, issue.11-12, pp.1747-1782, 2000.
DOI : 10.1016/S0165-1889(99)00087-1

B. Vandewoestyne and R. Cools, Good permutations for deterministic scrambled Halton sequences in terms of l2-discrepancy, Computational and Applied Mathematics, vol.189, issue.12, p.341361, 2006.

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

K. Q. Ye, Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments, Journal of the American Statistical Association, vol.8, issue.444, pp.1430-1439, 1998.
DOI : 10.1080/01621459.1993.10476423