{"total":27,"rows":[{"id":"2204.13750","title":"A First Runtime Analysis of the NSGA-II on a Multimodal Problem","created":"2022-04-28","cited_by_count":15,"area":null},{"id":"2208.08759","title":"Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover","created":"2022-08-18","cited_by_count":14,"area":null},{"id":"2209.13974","title":"From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds","created":"2022-09-28","cited_by_count":13,"area":null},{"id":"2104.06714","title":"Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution","created":"2021-04-14","cited_by_count":11,"area":null},{"id":"2305.13459","title":"The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem","created":"2023-05-22","cited_by_count":6,"area":null},{"id":"2104.03372","title":"Lower Bounds from Fitness Levels Made Easy","created":"2021-04-07","cited_by_count":5,"area":null},{"id":"2109.06584","title":"Choosing the Right Algorithm With Hints From Complexity Theory","created":"2021-09-14","cited_by_count":5,"area":null},{"id":"2302.12334","title":"Using Automated Algorithm Configuration for Parameter Control","created":"2023-02-23","cited_by_count":5,"area":null},{"id":"2304.10414","title":"How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs","created":"2023-04-20","cited_by_count":5,"area":null},{"id":"2103.10394","title":"On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials is Best","created":"2021-03-18","cited_by_count":3,"area":null},{"id":"2105.03090","title":"An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics","created":"2021-05-07","cited_by_count":3,"area":null},{"id":"2210.03618","title":"The $(1+(\\lambda,\\lambda))$ Global SEMO Algorithm","created":"2022-10-07","cited_by_count":3,"area":null},{"id":"2304.10316","title":"Search-Map-Search: A Frame Selection Paradigm for Action Recognition","created":"2023-04-20","cited_by_count":3,"area":null},{"id":"2407.14237","title":"Hyper-Heuristics Can Profit From Global Variation Operators","created":"2024-07-19","cited_by_count":3,"area":null},{"id":"2203.02693","title":"Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)","created":"2022-03-05","cited_by_count":2,"area":null},{"id":"2204.07637","title":"Towards a Stronger Theory for Permutation-based Evolutionary Algorithms","created":"2022-04-15","cited_by_count":2,"area":null},{"id":"2304.10848","title":"How Well Does the Metropolis Algorithm Cope With Local Optima?","created":"2023-04-21","cited_by_count":2,"area":null},{"id":"2206.09090","title":"From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms","created":"2022-06-18","cited_by_count":1,"area":null},{"id":"2302.01464","title":"Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler","created":"2023-02-02","cited_by_count":1,"area":null},{"id":"2302.08021","title":"Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus","created":"2023-02-16","cited_by_count":1,"area":null},{"id":"2312.10436","title":"Decomposing Hard SAT Instances with Metaheuristic Optimization","created":"2023-12-16","cited_by_count":1,"area":null},{"id":"2404.09687","title":"Plus Strategies are Exponentially Slower for Planted Optima of Random Height","created":"2024-04-15","cited_by_count":1,"area":null},{"id":"2101.01178","title":"Advances in Electron Microscopy with Deep Learning","created":"2021-01-04","cited_by_count":0,"area":null},{"id":"2207.04045","title":"Runtime Analysis for Permutation-based Evolutionary Algorithms","created":"2022-07-05","cited_by_count":0,"area":null},{"id":"2212.01771","title":"Can Evolutionary Clustering Have Theoretical Guarantees?","created":"2022-12-04","cited_by_count":0,"area":null},{"id":"2305.04553","title":"Larger Offspring Populations Help the $(1 + (\\lambda, \\lambda))$ Genetic Algorithm to Overcome the Noise","created":"2023-05-08","cited_by_count":0,"area":null},{"id":"2504.02972","title":"Improved Compact Genetic Algorithms with Efficient Caching","created":"2025-04-03","cited_by_count":0,"area":null}],"next_cursor":null}