Theory of Evolutionary Algorithms
暂无分享,去创建一个
L. Darrell Whitley | Benjamin Doerr | Nikolaus Hansen | Jonathan L. Shapiro | L. D. Whitley | Benjamin Doerr | Nikolaus Hansen | J. Shapiro | J. L. Shapiro
[1] V. Klee. Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? , 1977 .
[2] Peter Checkland,et al. Systems Thinking, Systems Practice , 1981 .
[3] Mark H. Overmars,et al. New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4] Peter Checkland,et al. Soft Systems Methodology in Action , 1990 .
[5] Walter Alden Tackett,et al. Recombination, selection, and the genetic construction of computer programs , 1994 .
[6] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[7] Nicholas I. M. Gould,et al. CUTE: constrained and unconstrained testing environment , 1995, TOMS.
[8] E. Tenner. Why things bite back : technology and the revenge of unintended consequences , 1996 .
[9] Peter J. Angeline,et al. The Royal Tree Problem, a Benchmark for Single and Multiple Population Genetic Programming , 1996 .
[10] S. Alonso,et al. The problem of the optimal biobjective spanning tree , 1998, Eur. J. Oper. Res..
[11] D. Kahneman,et al. Does Living in California Make People Happy? A Focusing Illusion in Judgments of Life Satisfaction , 1998 .
[12] C. Wilke,et al. Dynamic fitness landscapes in the quasispecies model , 1999 .
[13] W. Smit,et al. De wederzijdse beinvloeding van technologie en maatschappij: een Technology Assessment-benadering , 1999 .
[14] G. Loewenstein,et al. Wouldn't it be nice? Predicting future feelings. , 1999 .
[15] Thomas Martinetz,et al. Genetic Algorithms in Time-Dependent Environments , 1999, ArXiv.
[16] Thomas Hanne,et al. On the convergence of multiobjective evolutionary algorithms , 1999, Eur. J. Oper. Res..
[17] C. Chabris,et al. Gorillas in Our Midst: Sustained Inattentional Blindness for Dynamic Events , 1999, Perception.
[18] D. Gilbert,et al. Focalism: a source of durability bias in affective forecasting. , 2000, Journal of personality and social psychology.
[19] L. Kallel,et al. Theoretical Aspects of Evolutionary Computing , 2001, Natural Computing Series.
[20] Anne Adams,et al. Privacy in Multimedia Communications: Protecting Users, Not Just Data , 2001, BCS HCI/IHM.
[21] Marco Laumanns,et al. Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.
[22] Simon Joss,et al. Participatory technology assessment: European perspectives , 2002 .
[23] L. Cranor,et al. An Analysis of P3P Deployment on Commercial, Government, and Children's Web Sites as of May 2003 , 2003 .
[24] David W. Corne,et al. Properties of an adaptive archiving algorithm for storing nondominated vectors , 2003, IEEE Trans. Evol. Comput..
[25] Lorrie Faith Cranor,et al. P3P: Making Privacy Policies More Useful , 2003, IEEE Secur. Priv..
[26] Nicholas I. M. Gould,et al. CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.
[27] V. Selivanov. Boolean Hierarchies of Partitions over a Reducible Base , 2004 .
[28] Marco Laumanns,et al. Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions , 2004, IEEE Transactions on Evolutionary Computation.
[29] Thomas Jansen,et al. Bridging the Gap Between Theory and Practice , 2004, PPSN.
[30] Sven Kosub. NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems , 2004, Theory of Computing Systems.
[31] Edmund K. Burke,et al. The Tree-String Problem: An Artificial Domain for Structure and Content Search , 2005, EuroGP.
[32] Carsten Witt,et al. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .
[33] Jo Pierson,et al. Configuring Living Labs For A ‘Thick’ Understanding Of Innovation , 2005 .
[34] Mai Gehrke,et al. Generalized Kripke Frames , 2006, Stud Logica.
[35] Sven Ove Hansson,et al. The case for ethical technology assessment (eTA) , 2006 .
[36] Audley Genus. Rethinking constructive technology assessment as democratic, reflective, discourse , 2006 .
[37] Jing J. Liang,et al. Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .
[38] Scott Dick,et al. A Survey and Analysis of the P3P Protocol's Agents, Adoption, Maintenance, and Future , 2007, IEEE Transactions on Dependable and Secure Computing.
[39] Joshua D. Knowles,et al. Multiobjectivization by Decomposition of Scalar Cost Functions , 2008, PPSN.
[40] Timothy M. Chan. A (slightly) faster algorithm for klee's measure problem , 2008, SCG '08.
[41] S. Wyatt. Technological determinism is dead; Long live technological determinism. , 2008 .
[42] A. Sen,et al. The idea of justice , 2009, Princeton Readings in Political Thought.
[43] Rutger O. van Merkerk,et al. Tailoring CTA for emerging technologies , 2008 .
[44] Victor L. Selivanov,et al. Fine hierarchies and m-reducibilities in theoretical computer science , 2008, Theor. Comput. Sci..
[45] M. Lynch,et al. The handbook of science and technology studies , 2008 .
[46] Joyce Fortune,et al. The project‐specific Formal System Model , 2009 .
[47] Nicola Beume,et al. S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure Problem , 2009, Evolutionary Computation.
[48] Helen Nissenbaum,et al. Privacy in Context - Technology, Policy, and the Integrity of Social Life , 2009 .
[49] Dirk Sudholt,et al. The benefit of migration in parallel evolutionary algorithms , 2010, GECCO '10.
[50] P. Stadler,et al. Mathematik in den Naturwissenschaften Leipzig Combinatorial Vector Fields and the Valley Structure of Fitness Landscapes , 2009 .
[51] Tom Schaul,et al. Exponential natural evolution strategies , 2010, GECCO '10.
[52] Dirk Sudholt,et al. General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms , 2010, PPSN.
[53] Frank Neumann,et al. Set-based multi-objective optimization, indicators, and deteriorative cycles , 2010, GECCO '10.
[54] Anne Auger,et al. Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009 , 2010, GECCO '10.
[55] Per Kristian Lehre,et al. Black-Box Search by Unbiased Variation , 2010, GECCO '10.
[56] P. Suganthan,et al. Problem Definitions and Evaluation Criteria for the CEC 2010 Competition on Constrained Real- Parameter Optimization , 2010 .
[57] Pietro Simone Oliveto,et al. On the effectiveness of crossover for migration in parallel evolutionary algorithms , 2011, GECCO '11.
[58] Dirk Sudholt,et al. Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract) , 2011, ISAAC.
[59] Una-May O'Reilly,et al. Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics , 2010, FOGA '11.
[60] Joshua D. Knowles,et al. Efficient discovery of anti-inflammatory small molecule combinations using evolutionary computing , 2011, Nature chemical biology.
[61] Eric Ries,et al. The lean startup : how constant innovation creates radically successful businesses , 2011 .
[62] Richard P. Eibach,et al. Focalism and the Failure to Foresee Unintended Consequences , 2011 .
[63] Lothar Thiele,et al. Mutation operator characterization: Exhaustiveness, locality, and bias , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).
[64] Marco Laumanns,et al. On Sequential Online Archiving of Objective Vectors , 2011, EMO.
[65] Leonardo Vanneschi,et al. The K landscapes: a tunably difficult benchmark for genetic programming , 2011, GECCO '11.
[66] Victor L. Selivanov. A Fine Hierarchy of ω-Regular k-Partitions , 2011, CiE.
[67] Rainer Böhme,et al. Collective Exposure: Peer Effects in Voluntary Disclosure of Personal Data , 2011, Financial Cryptography.
[68] Dirk Sudholt,et al. Homogeneous and Heterogeneous Island Models for the Set Cover Problem , 2012, PPSN.
[69] Thomas Jansen,et al. Fixed budget computations: a different perspective on run time analysis , 2012, GECCO '12.
[70] Lorrie Faith Cranor,et al. Necessary But Not Sufficient: Standardized Mechanisms for Privacy Notice and Choice , 2012, J. Telecommun. High Technol. Law.
[71] Joyce Fortune,et al. Using systems thinking to evaluate a major project: The case of the Gateshead Millennium Bridge , 2012 .
[72] Jörg Lässig,et al. General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms , 2012, ArXiv.
[73] Andrew M. Sutton,et al. The max problem revisited: the importance of mutation in genetic programming , 2012, GECCO '12.
[74] Subhash Suri,et al. On Klee's measure problem for grounded boxes , 2012, SoCG '12.
[75] Arina Buzdalova,et al. Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning , 2012, 2012 11th International Conference on Machine Learning and Applications.
[76] Willem L. Fouché,et al. Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures , 2012, WoLLIC.
[77] M. Angela Sasse,et al. Privacy is a process, not a PET: a theory for effective privacy practice , 2012, NSPW '12.
[78] Manuel López-Ibáñez,et al. Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms , 2012, PPSN.
[79] Willem L. Fouché. Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures , 2012, Theory of Computing Systems.
[80] P. Stadler,et al. Landscape Encodings Enhance Optimization , 2011, PloS one.
[81] Benjamin Doerr,et al. Lessons from the black-box: fast crossover-based genetic algorithms , 2013, GECCO '13.
[82] Mai Gehrke. Stone duality, topological algebra, and recognition , 2013, ArXiv.
[83] Karl Bringmann,et al. Bringing Order to Special Cases of Klee's Measure Problem , 2013, MFCS.
[84] Olivier Teytaud,et al. Noisy optimization complexity under locality assumption , 2013, FOGA XII '13.
[85] Sabrina Sauer,et al. User innovativeness in living laboratories: everyday user improvisations with ICTs as a source of innovation , 2013 .
[86] Olivier Teytaud,et al. Noisy optimization convergence rates , 2013, GECCO '13 Companion.
[87] Ian Brown. Lawful Interception Capability Requirements , 2013 .
[88] Alberto Moraglio,et al. Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions , 2013, FOGA XII '13.
[89] Timothy M. Chan. Klee's Measure Problem Made Easy , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[90] Joshua D. Knowles,et al. On Handling Ephemeral Resource Constraints in Evolutionary Search , 2013, Evolutionary Computation.
[91] Jens Grossklags,et al. An online experiment of privacy authorization dialogues for social applications , 2013, CSCW.
[92] Verónica Becher,et al. A polynomial-time algorithm for computing absolutely normal numbers , 2013, Inf. Comput..
[93] Thomas Jansen,et al. Understanding randomised search heuristics lessons from the evolution of theory: A case study , 2014 .
[94] Dirk Sudholt,et al. General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms* , 2014, Evolutionary Computation.
[95] Jing Qin,et al. Geometry and Coarse-Grained Representations of Landscapes , 2014 .
[96] Philipp Schlicht,et al. Wadge-like reducibilities on arbitrary quasi-Polish spaces , 2012, Mathematical Structures in Computer Science.
[97] Michael R. Bussieck,et al. PAVER 2.0: an open source environment for automated performance analysis of benchmarking data , 2014, J. Glob. Optim..
[98] Rolf Wanka,et al. How Much Forcing Is Necessary to Let the Results of Particle Swarms Converge? , 2014, ICSIBO.
[99] Zbigniew Michalewicz,et al. A comprehensive benchmark set and heuristics for the traveling thief problem , 2014, GECCO.
[100] Frank Neumann,et al. On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling , 2015, IJCAI.
[101] Rolf Wanka,et al. Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis , 2015, GECCO.
[102] Nicholas I. M. Gould,et al. CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization , 2013, Computational Optimization and Applications.
[103] Benjamin Doerr,et al. Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem , 2015, EvoCOP.
[104] Rolf Wanka,et al. Particle swarm optimization almost surely finds local optima , 2013, GECCO '13.
[105] Yann Ollivier,et al. Laplace's Rule of Succession in Information Geometry , 2015, GSI.
[106] Carsten Witt,et al. Population Size vs. Mutation Strength for the (1+λ) EA on OneMax , 2015, GECCO.