The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
暂无分享,去创建一个
Benjamin Doerr | Timo Kötzing | Johannes Lengler | J. A. Gregor Lagodzinski | Benjamin Doerr | Timo Kötzing | J. Lengler | J. Lagodzinski
[1] Angelika Steger,et al. Drift Analysis and Evolutionary Algorithms Revisited , 2016, Combinatorics, Probability and Computing.
[2] Andrew M. Sutton,et al. The max problem revisited: the importance of mutation in genetic programming , 2012, GECCO '12.
[3] David E. Goldberg,et al. Where Does the Good Stuff Go, and Why? How Contextual Semantics Influences Program Structure in Simple Genetic Programming , 1998, EuroGP.
[4] Pietro Simone Oliveto,et al. On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions , 2018, AAAI.
[5] Carsten Witt,et al. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.
[6] Alberto Moraglio,et al. Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions , 2013, FOGA XII '13.
[7] Pietro Simone Oliveto,et al. Evolving boolean functions with conjunctions and disjunctions via genetic programming , 2019, GECCO.
[8] G. Grimmett,et al. Probability and random processes , 2002 .
[9] Una-May O'Reilly,et al. Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics , 2010, FOGA '11.
[10] Pietro Simone Oliveto,et al. On the Analysis of Simple Genetic Programming for Evolving Boolean Functions , 2016, EuroGP.
[11] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[12] Benjamin Doerr,et al. Bounding bloat in genetic programming , 2017, GECCO.
[13] Una-May O'Reilly,et al. Program Search with a Hierarchical Variable Lenght Representation: Genetic Programming, Simulated Annealing and Hill Climbing , 1994, PPSN.
[14] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[15] Timo Kötzing. Concentration of First Hitting Times Under Additive Drift , 2015, Algorithmica.
[16] Una-May O'Reilly,et al. An analysis of genetic programming , 1995 .
[17] Markus Wagner,et al. On the Performance of Different Genetic Programming Approaches for the SORTING Problem , 2015, Evolutionary Computation.
[18] Markus Wagner,et al. Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations , 2012, PPSN.
[19] Pietro Simone Oliveto,et al. Computational Complexity Analysis of Genetic Programming , 2018, Theory of Evolutionary Computation.
[20] Timo Kötzing,et al. Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming , 2018, PPSN.
[21] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2011, Algorithmica.
[22] Markus Wagner,et al. Single- and multi-objective genetic programming: New runtime results for sorting , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).
[23] Daniel Johannsen,et al. Random combinatorial structures and randomized search heuristics , 2010 .
[24] Frank Neumann,et al. Computational complexity analysis of multi-objective genetic programming , 2012, GECCO '12.
[25] Thomas Bäck,et al. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , 2020, Theory of Evolutionary Computation.
[26] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[27] Markus Wagner,et al. Single- and multi-objective genetic programming: new bounds for weighted order and majority , 2013, FOGA XII '13.
[28] Luca Manzoni,et al. A comparison between geometric semantic GP and cartesian GP for boolean functions learning , 2014, GECCO.
[29] Xin Yao,et al. A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.
[30] Markus Wagner,et al. Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics , 2012, PPSN.
[31] Sean Luke,et al. Lexicographic Parsimony Pressure , 2002, GECCO.
[32] Frank Neumann,et al. PAC learning and genetic programming , 2011, GECCO '11.