Practical performance models of algorithms in evolutionary program induction and other domains
DOI10.1016/J.ARTINT.2010.07.005zbMATH Open1210.68101DBLPjournals/ai/GraffP10OpenAlexW2102705643WikidataQ58475566 ScholiaQ58475566MaRDI QIDQ622115FDOQ622115
Authors: Mario Graff, Riccardo Poli 
Publication date: 31 January 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.07.005
Recommendations
- scientific article; zbMATH DE number 1668689
- Analysis and a survey of evolutionary models
- PERFORMANCE EVALUATION OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING IN OPTIMIZATION AND MACHINE LEARNING
- Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
- Evolutionary programming: an application to clustering
performance predictionalgorithm selection problemalgorithm taxonomiesevolution algorithmsprogram induction
Cites Work
- Least angle regression. (With discussion)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hierarchical clustering schemes
- Title not available (Why is that?)
- SATzilla: portfolio-based algorithm selection for SAT
- Title not available (Why is that?)
- Hierarchical Hardness Models for SAT
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Gene expression programming: a new adaptive algorithm for solving problems
- Principles and Practice of Constraint Programming – CP 2004
- Evolutionary computation. 1. Basic algorithms and operators
- Title not available (Why is that?)
- Drift analysis and average time complexity of evolutionary algorithms
- Modeling genetic algorithms with Markov chains.
- On classes of functions for which no free lunch results hold
- Principles and practice of constraint programming -- CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23--27, 2007. Proceedings
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- Real royal road functions -- where crossover provably is essential
- Towards an analytic framework for analysing the computation time of evolutionary algorithms
- Empirical evaluation of the improved rprop learning algorithms
- Computing single source shortest paths using single-objective fitness
- Empirical hardness models, methodology and a case study on combinatorial auctions
- On the analysis of the \((1+1)\) evolutionary algorithm
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning to select branching rules in the DPLL procedure for satisfiability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free lunches for function and program induction
- AI*IA 2005: Advances in Artificial Intelligence
- Continuous Optimisation Theory Made Easy? Finite-Element Models of Evolutionary Strategies, Genetic Algorithms and Particle Swarm Optimizers
- Evolutionary algorithms and matroid optimization problems
- Principles and practice of constraint programming -- CP 2004. 10th international conference, CP 2004, Toronto, Canada, September 27--October 1, 2004. Proceedings
Cited In (1)
Uses Software
This page was built for publication: Practical performance models of algorithms in evolutionary program induction and other domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622115)
