28620 articles – 22133 references  [version française]
.:. Browse > By authors > Auger .:.
66 documents ordered by :
First Previous 1 - 2 - 3 - 4 - 5 - 6 - 7 Next Last
fulltext access Benchmarking the (1+1)-ES with One-Fifth Success rule on the BBOB-2009 Noisy Testbed
Auger A.
Dans ACM-GECCO Genetic and Evolutionary Computation Conference (2009) [inria-00430516 - version 1]
fulltext access Benchmarking the (1+1) Evolution Strategy with One-Fifth Success Rule on the BBOB-2009 Function Testbed
Auger A.
Dans ACM-GECCO Genetic and Evolutionary Computation Conference (2009) [inria-00430515 - version 1]
fulltext access Continuous lunches are free plus the design of optimal optimization algorithms
Auger A., Teytaud O.
Algorithmica (2009) [inria-00369788 - version 1]
fulltext access Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup
Hansen N., Auger A., Finck S., Ros R.
N° RR-6828 (2009) [inria-00362649 - version 3]
fulltext access Real-Parameter Black-Box Optimization Benchmarking 2009: Noisy Functions Definitions
Hansen N., Finck S., Ros R., Auger A.
N° RR-6869 (2009) [inria-00369466 - version 1]
fulltext access Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions
Hansen N., Finck S., Ros R., Auger A.
N° RR-6829 (2009) [inria-00362633 - version 1]
fulltext access On multiplicative noise models for stochastic search
Jebalia M., Auger A.
Dans Parallel Problem Solving From Nature (2008) [inria-00287725 - version 1]
fulltext access PSO Facing Non-Separable and Ill-Conditioned Problems
Hansen N., Ros R., Mauny N., Schoenauer M., Auger A.
N° RR-6447 (2008) [inria-00250078 - version 2]
fulltext access Log-linear Convergence and Optimal Bounds for the $(1+1)$-ES
Jebalia M., Auger A., Liardet P.
Dans Evolution Artificielle 4926/2008 (2007) 207-218 [inria-00173483 - version 4]
fulltext access Identification of the Isotherm Function in Chromatography Using CMA-ES
Jebalia M., Auger A., Schoenauer M., James F., Postel M.
Dans IEEE Congress on Evolutionary Computation (2007) 4289-4296 [inria-00175852 - version 1]