Evolutionary optimization of low-discrepancy sequences

DOI10.1145/2133390.2133393zbMATH Open1386.65162OpenAlexW2100184918MaRDI QIDQ4635186FDOQ4635186

Olivier Teytaud, Christian Gagné, François-Michel de Rainville, Denis Laurendeau

Publication date: 16 April 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2133390.2133393

zbMATH Keywords

optimizationHalton sequenceevolutionary algorithmquasi-random number generatornearly orthogonal Latin hypercube

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Factorial statistical designs (62K15)

Cited In (7)

• On the characteristics and structures of dynamical systems suitable for reservoir computing
• An iterative Bayesian filtering framework for fast and automated calibration of DEM models
• An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
• Analysis of evolutionary algorithms for the longest common subsequence problem
• Calculation of Discrepancy Measures and Applications
• Assessing Basin Identification Methods for Locating Multiple Optima
• Dependence properties of scrambled Halton sequences

This page was built for publication: Evolutionary optimization of low-discrepancy sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635186)