default search action
18th PPSN 2024: Hagenberg, Austria - Part III
- Michael Affenzeller
, Stephan M. Winkler
Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part III. Lecture Notes in Computer Science 15150, Springer 2024, ISBN 978-3-031-70070-5
Theoretical Aspects of Nature-Inspired Optimization
- Johannes Lengler, Konstantin Sturm:
Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes. 3-18 - Denis Antipov
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. 19-35 - Frank Neumann
Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. 36-52 - Sumit Adak
Runtime Analysis of a Multi-valued Compact Genetic Algorithm on Generalized OneMax. 53-69 - Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller:
Faster Optimization Through Genetic Drift. 70-85 - Denis Antipov
Greedy Versus Curious Parent Selection for Multi-objective Evolutionary Algorithms. 86-101 - Sacha Cerf, Johannes Lengler:
How Population Diversity Influences the Efficiency of Crossover. 102-116 - Per Kristian Lehre
Overcoming Binary Adversarial Optimisation with Competitive Coevolution. 117-132 - Jiwon Lee
Evolving Populations of Solved Subgraphs with Crossover and Constraint Repair. 133-148 - Jonathan Gadea Harder
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. 149-165 - Frank Neumann, Günter Rudolph:
Archive-Based Single-Objective Evolutionary Algorithms for Submodular Optimization. 166-180 - Denis Antipov
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. 181-196 - Benjamin Doerr
Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions. 197-212 - Mario Alejandro Hevia Fajardo
Ranking Diversity Benefits Coevolutionary Algorithms on an Intransitive Game. 213-229 - Duc-Cuong Dang, Andre Opris, Dirk Sudholt:
On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently. 230-245 - Duc-Cuong Dang, Andre Opris, Dirk Sudholt:
Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms. 246-263 - Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr:
Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. 264-279 - Mingfeng Li
When Does the Time-Linkage Property Help Optimization by Evolutionary Algorithms? 280-294 - Shengjie Ren, Chao Bian, Miqing Li, Chao Qian:
A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2). 295-312
(Evolutionary) Machine Learning and Neuroevolution
- Gijs Schröder
Population-Based Algorithms Built on Weighted Automata. 315-332 - Shoffan Saifullah
Automatic Brain Tumor Segmentation Using Convolutional Neural Networks: U-Net Framework with PSO-Tuned Hyperparameters. 333-351 - Damy M. F. Ha
Learning Discretized Bayesian Networks with GOMEA. 352-368 - Ganyuan Luo
Pareto-Informed Multi-objective Neural Architecture Search. 369-385 - Hiroki Shiraishi
A Variable-Length Fuzzy Set Representation for Learning Fuzzy-Classifier Systems. 386-402
Evolvable Hardware and Evolutionary Robotics
- Babak Hosseinkhani Kargar
Exploring Proprioceptive Feedback in the Evolution of Modular Robots. 405-418
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: