Filtrer vos résultats
- 90
- 51
- 79
- 52
- 4
- 3
- 2
- 1
- 138
- 6
- 1
- 4
- 10
- 8
- 27
- 24
- 17
- 15
- 1
- 9
- 6
- 8
- 5
- 4
- 1
- 2
- 141
- 126
- 26
- 17
- 13
- 5
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 141
- 40
- 14
- 12
- 9
- 9
- 8
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
141 résultats
|
|
Analyzing randomized search heuristics via stochastic dominationTheoretical Computer Science, 2019, 773, pp.115-137. ⟨10.1016/j.tcs.2018.09.024⟩
Article dans une revue
hal-04484766v1
|
||
|
|
Working principles of binary differential evolutionGECCO '18: Genetic and Evolutionary Computation Conference, 2018, Kyoto Japan, France. pp.1103-1110, ⟨10.1145/3205455.3205623⟩
Communication dans un congrès
hal-04484631v1
|
||
|
|
Runtime Analysis of a Heavy-Tailed $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm on Jump FunctionsParallel Problem Solving from Nature, PPSN 2020, 2020, Leiden, Netherlands. pp.545-559, ⟨10.1007/978-3-030-58115-2_38⟩
Communication dans un congrès
hal-04485753v1
|
||
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run timeTheoretical Computer Science, 2020, 816, pp.144-168. ⟨10.1016/j.tcs.2020.01.011⟩
Article dans une revue
hal-04484792v1
|
|||
The (1 + ( λ,λ )) GA is even faster on multimodal problemsGECCO '20: Genetic and Evolutionary Computation Conference, 2020, Cancún, Mexico. pp.1259-1267, ⟨10.1145/3377930.3390148⟩
Communication dans un congrès
hal-04484802v1
|
|||
|
|
On negative dependence properties of Latin hypercube samples and scrambled netsJournal of Complexity, 2021, 67, pp.101589. ⟨10.1016/J.JCO.2021.101589⟩
Article dans une revue
hal-04485604v1
|
||
Lazy parameter tuning and controlGECCO '21: Genetic and Evolutionary Computation Conference, 2021, Lille, France. pp.1115-1123, ⟨10.1145/3449639.3459377⟩
Communication dans un congrès
hal-04486015v1
|
|||
|
|
Choosing the Right Algorithm With Hints From Complexity TheoryThirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}, Aug 2021, Montreal, Canada. pp.1697-1703, ⟨10.24963/ijcai.2021/234⟩
Communication dans un congrès
hal-03344224v2
|
||
|
|
Choosing the right algorithm with hints from complexity theoryGECCO '22: Genetic and Evolutionary Computation Conference, 2022, Boston, United States. pp.45-46, ⟨10.1145/3520304.3534069⟩
Communication dans un congrès
hal-04487192v1
|
||
|
|
Non-existence of linear universal drift functionsTheoretical Computer Science, 2012, 436, pp.71 - 86. ⟨10.1016/j.tcs.2012.01.048⟩
Article dans une revue
hal-01797909v1
|
||
Probabilistic Lower Discrepancy Bounds for Latin Hypercube SamplesContemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan, 2018, 978-3-319-72455-3
Chapitre d'ouvrage
hal-01668257v1
|
|||
|
|
The Univariate Marginal Distribution Algorithm Copes Well With Deception and EpistasisEvolutionary Computation, In press, 29 (4), pp.543--563. ⟨10.1162/evco_a_00293⟩
Article dans une revue
hal-03277754v1
|
||
|
|
Playing Mastermind with Many ColorsJournal of the ACM (JACM), 2016, 63, ⟨10.1145/2987372⟩
Article dans une revue
hal-01481969v1
|
||
Money for Nothing: Speeding Up Evolutionary Algorithms Through Better InitializationGECCO '15 - 2015 Annual Conference on Genetic and Evolutionary Computation, Jul 2015, Madrid, Spain. pp.815-822, ⟨10.1145/2739480.2754760⟩
Communication dans un congrès
hal-01272863v1
|
|||
|
|
The unbiased black-box complexity of partition is polynomialArtificial Intelligence, 2014, 216, pp.12. ⟨10.1016/j.artint.2014.07.009⟩
Article dans une revue
hal-01086507v1
|
||
|
|
Runtime Analysis of the SMS-EMOA For Many-Objective OptimizationAAAI Conference on Artificial Intelligence, AAAI 2024, 2024, Vancouver (BC), Canada. pp.20874-20882, ⟨10.1609/AAAI.V38I18.30077⟩
Communication dans un congrès
hal-04360952v2
|
||
Static and Self-Adjusting Mutation Strengths for Multi-valued Decision VariablesAlgorithmica, 2018, 80, pp.1732-1768. ⟨10.1007/s00453-017-0341-1⟩
Article dans une revue
hal-01668260v1
|
|||
Precise Runtime Analysis for PlateausParallel Problem Solving from Nature - PPSN XV - 15th International Conference, 2018, Coimbra, Portugal. pp.117-128
Communication dans un congrès
hal-04484654v1
|
|||
|
|
Playing Mastermind With Constant-Size MemorySTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.441-452
Communication dans un congrès
hal-00678182v1
|
||
|
|
Self-adjusting mutation rates with provably optimal success rulesGECCO 2019 - The Genetic and Evolutionary Computation Conference, Jul 2019, Prague, Czech Republic. pp.1479-1487, ⟨10.1145/3321707.3321733⟩
Communication dans un congrès
hal-02175768v1
|
||
|
|
An Extended Jump Function Benchmark for the Analysis of Randomized Search Heuristics2021
Pré-publication, Document de travail
hal-03220178v2
|
||
A gentle introduction to theory (for non-theoreticians)GECCO '22: Genetic and Evolutionary Computation Conference, 2022, Boston, United States. pp.890-921, ⟨10.1145/3520304.3533628⟩
Communication dans un congrès
hal-04487159v1
|
|||
|
|
Multiplicative Up-DriftAlgorithmica, 2021, 83 (10), pp.3017-3058. ⟨10.1007/s00453-020-00775-7⟩
Article dans une revue
hal-03408982v1
|
||
Hot off the Press: Runtime Analysis for the NSGA-II - Provable Speed-Ups From CrossoverGECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation, 2023, Lisbon Portugal, France. pp.19-20, ⟨10.1145/3583133.3595845⟩
Communication dans un congrès
hal-04483225v1
|
|||
|
|
Exponential Upper Bounds for the Runtime of Randomized Search HeuristicsParallel Problem Solving from Nature, PPSN 2020, 2020, Leiden, Netherlands. pp.619-633, ⟨10.1007/978-3-030-58115-2_43⟩
Communication dans un congrès
hal-04485770v1
|
||
|
|
A Sharp Discrepancy Bound for Jittered Sampling2021
Pré-publication, Document de travail
hal-03203695v3
|
||
|
|
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnesTheoretical Computer Science, 2021, 851, pp.121-128. ⟨10.1016/J.TCS.2020.11.028⟩
Article dans une revue
hal-04485607v1
|
||
|
|
Improved Protocols and Hardness Results for the Two-Player Cryptogenography ProblemIEEE Transactions on Information Theory, 2020, 66 (9), pp.5729-5741. ⟨10.1109/TIT.2020.2978385⟩
Article dans une revue
hal-04484795v1
|
||
|
|
Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic AlgorithmAlgorithmica, 2018, 80, pp.1658-1709. ⟨10.1007/s00453-017-0354-9⟩
Article dans une revue
hal-01668262v1
|
||
|
|
Working principles of binary differential evolutionTheoretical Computer Science, 2020, 801, pp.1103-1110. ⟨10.1145/3205455.3205623⟩
Article dans une revue
hal-04484791v1
|