conftrace_

runtime analysis

41 papers

Explore in graph

Co-occurring keywords

evolutionary algorithm (264) multi-objective optimization (364) pareto front (63) genetic algorithm (109) population dynamics (22) many-objective optimization (6) drift analysis (4) crossover operator (7) local optima (19) pareto optimization (78)

Papers

Theoretical and Empirical Analysis of Lehmer Codes to Search Permutation Spaces with Evolutionary Algorithms AAAI 2026
Not Just for Archiving: Provable Benefits of Reusing the Archive in Evolutionary Multi-objective Optimization AAAI 2026
Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds AAAI 2026
Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy IJCAI 2025
Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It IJCAI 2025
Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem IJCAI 2025
Fast Contiguous Somatic Hypermutations for Single-Objective Optimisation and Multi-Objective Optimisation Via Decomposition AAAI 2025
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track) AAAI 2025
Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game AAAI 2025
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm IJCAI 2025
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update IJCAI 2025
A Theoretical Perspective on Why Stochastic Population Update Needs an Archive in Evolutionary Multi-objective Optimization IJCAI 2025
Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator IJCAI 2025
(1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error AAAI 2025
Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces AAAI 2025
Speeding Up the NSGA-II with a Simple Tie-Breaking Rule AAAI 2025
A Many-Objective Problem Where Crossover Is Provably Indispensable AAAI 2025
Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms IJCAI 2024
Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations AAAI 2024
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization AAAI 2024
A Fast Algorithm for MaxSAT above Half Number of Clauses IJCAI 2024
Feedback-Based Adaptive Crossover-Rate in Evolutionary Computation IJCAI 2024
A faster and simpler algorithm for learning shallow networks COLT 2024
How to Use the Metropolis Algorithm for Multi-Objective Optimization? AAAI 2024
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms IJCAI 2023