A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Randomized algorithms
Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Optimal Mutation Rates in Genetic Search
Proceedings of the 5th International Conference on Genetic Algorithms
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
Rigorous hitting times for binary mutations
Evolutionary Computation
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Theoretical Aspects of Evolutionary Algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Expected Runtime and the Success Probability of Evolutionary Algorithms
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Journal of Computer Science and Technology
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Not all linear functions are equally difficult for the compact genetic algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the impact of objective function transformations on evolutionary and black-box algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Rigorous runtime analysis of a (μ+1)ES for the sphere function
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Information landscapes and the analysis of search algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Some theoretical results about the computation time of evolutionary algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The Cooperative Coevolutionary (1+1) EA
Evolutionary Computation
On the Choice of the Offspring Population Size in Evolutionary Algorithms
Evolutionary Computation
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
The one-dimensional Ising model: mutation versus recombination
Theoretical Computer Science
Probabilistic runtime analysis of (1 +, λ),ES using isotropic mutations
Proceedings of the 8th annual conference on Genetic and evolutionary computation
On the analysis of the (1+1) memetic algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
How randomized search heuristics find maximum cliques in planar graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
On the effect of populations in evolutionary multi-objective optimization
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
How the (1 + 1) ES using isotropic mutations minimizes positive definite quadratic forms
Theoretical Computer Science - Foundations of genetic algorithms
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
Theoretical Computer Science
On the runtime analysis of the 1-ANT ACO algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Do additional objectives make a problem harder?
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Approximating covering problems by randomized search heuristics using multi-objective models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Rigorous analyses of simple diversity mechanisms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A building-block royal road where crossover is provably essential
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
Theoretical Computer Science
Optimal parameters for search using a barrier tree Markov model
Theoretical Computer Science
Speeding up evolutionary algorithms through asymmetric mutation operators
Evolutionary Computation
First steps to the runtime complexity analysis of ant colony optimization
Computers and Operations Research
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
Computers and Operations Research
Runtime analysis of binary PSO
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computing minimum cuts by randomized search heuristics
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Comparing global and local mutations on bit strings
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
A new approach to estimating the expected first hitting time of evolutionary algorithms
Artificial Intelligence
About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space
Computational Intelligence and Security
Convergence Analysis of Evolution Strategies with Random Numbers of Offspring
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
A Blend of Markov-Chain and Drift Analysis
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
On the choice of the parent population size*
Evolutionary Computation
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
Crossover Can Be Constructive When Computing Unique Input Output Sequences
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
About the Computation Time of Adaptive Evolutionary Algorithms
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Why standard particle swarm optimisers elude a theoretical runtime analysis
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Single- and multi-objective evolutionary algorithms for graph bisectioning
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
On the utility of the population size for inversely fitness proportional mutation rates
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Black-box search by elimination of fitness functions
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Real options approach to evaluating genetic algorithms
Applied Soft Computing
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science
The impact of parametrization in memetic evolutionary algorithms
Theoretical Computer Science
On average time complexity of evolutionary negative selection algorithms for anomaly detection
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Maximal age in randomized search heuristics with aging
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
On the performance effects of unbiased module encapsulation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Comparing Different Aging Operators
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
On the effects of adding objectives to plateau functions
IEEE Transactions on Evolutionary Computation
A pheromone-rate-based analysis on the convergence time of ACO algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Theoretical analysis of rank-based mutation: combining exploration and exploitation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
When is an estimation of distribution algorithm better than an evolutionary algorithm?
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Runtime analysis of an ant colony optimization algorithm for TSP instances
IEEE Transactions on Evolutionary Computation
Analysis of an asymmetric mutation operator
Evolutionary Computation
When to use bit-wise neutrality
Natural Computing: an international journal
A self-stabilizing algorithm for cut problems in synchronous networks
Theoretical Computer Science
On the brittleness of evolutionary algorithms
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Analysis of a simple evolutionary algorithm for minimization in euclidean spaces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Convergence time analysis for the multi-objective counting ones problem
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
On the optimization of monotone polynomials by the (1+1) EA and randomized local search
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Analysis of the (1+1) EA for a dynamically bitwise changing ONEMAX
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Runtime analysis of a binary particle swarm optimizer
Theoretical Computer Science
On the running time analysis of the (1+1) evolutionary algorithm for the subset sum problem
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
The detrimentality of crossover
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Empirical investigation of simplified step-size control in metaheuristics with a view to theory
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Theoretical analysis of local search in software testing
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
A few ants are enough: ACO with iteration-best update
Proceedings of the 12th annual conference on Genetic and evolutionary computation
The benefit of migration in parallel evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Ant colony optimization and the minimum cut problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Can quantum search accelerate evolutionary algorithms?
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Black-box search by unbiased variation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Quasirandom evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Ant colony optimization for stochastic shortest path problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
Optimal fixed and adaptive mutation rates for the leadingones problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Optimizing monotone functions can be difficult
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
General lower bounds for the running time of evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Towards analyzing recombination operators in evolutionary search
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Drift analysis with tail bounds
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
More effective crossover operators for the all-pairs shortest path problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
General scheme for analyzing running times of parallel evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Analyzing different variants of immune inspired somatic contiguous hypermutations
Theoretical Computer Science
On benefits and drawbacks of aging strategies for randomized search heuristics
Theoretical Computer Science
Genetic regulatory network-based symbiotic evolution
Expert Systems with Applications: An International Journal
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
On the effect of populations in evolutionary multi-objective optimisation**
Evolutionary Computation
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
A new method for modeling the behavior of finite population evolutionary algorithms
Evolutionary Computation
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science
Illustration of fairness in evolutionary multi-objective optimization
Theoretical Computer Science
Free lunches on the discrete Lipschitz class
Theoretical Computer Science
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Non-uniform mutation rates for problems with unknown solution lengths
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Adaptive population models for offspring populations and parallel evolutionary algorithms
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Simple max-min ant systems and the optimization of linear pseudo-boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Information Sciences: an International Journal
Analysis of (1+1) evolutionary algorithm and randomized local search with memory
Evolutionary Computation
Finding mount everest and handling voids
Evolutionary Computation
On the deleterious effects of a priori objectives on evolution and representation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
On the effectiveness of crossover for migration in parallel evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Fitness-levels for non-elitist populations
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Sharp bounds by probability-generating functions and variable drift
Proceedings of the 13th annual conference on Genetic and evolutionary computation
PAC learning and genetic programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Collisions are helpful for computing unique input-output sequences
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Geometry of evolutionary algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Variation in artificial immune systems: hypermutations with mutation potential
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Memory-restricted black-box complexity of OneMax
Information Processing Letters
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Revisiting the restricted growth function genetic algorithm for grouping problems
Evolutionary Computation
Algorithms (x, sigma, eta): quasi-random mutations for evolution strategies
EA'05 Proceedings of the 7th international conference on Artificial Evolution
A time complexity analysis of ACO for linear functions
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Accessibility and runtime between convex neutral networks
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A comparison of simulated annealing with a simple evolutionary algorithm
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Rigorous runtime analysis of the (1+1) ES: 1/5-rule and ellipsoidal fitness landscapes
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Theoretical Computer Science
Local search in evolutionary algorithms: the impact of the local search frequency
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A large population size can be unhelpful in evolutionary algorithms
Theoretical Computer Science
Non-existence of linear universal drift functions
Theoretical Computer Science
The use of tail inequalities on the probable computational time of randomized search heuristics
Theoretical Computer Science
Crossover speeds up building-block assembly
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Computational complexity analysis of multi-objective genetic programming
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Fixed budget computations: a different perspective on run time analysis
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Geometry of evolutionary algorithms
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Computing longest common subsequences with the B-cell algorithm
ICARIS'12 Proceedings of the 11th international conference on Artificial Immune Systems
On algorithm-dependent boundary case identification for problem classes
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Runtime analysis of simple interactive evolutionary biobjective optimization algorithms
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science
Achieving scalable model-based testing through test case diversity
ACM Transactions on Software Engineering and Methodology (TOSEM)
Black-Box complexity: breaking the O(n logn) barrier of leadingones
EA'11 Proceedings of the 10th international conference on Artificial Evolution
When do evolutionary algorithms optimize separable functions in parallel?
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Single- and multi-objective genetic programming: new bounds for weighted order and majority
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
A multiset genetic algorithm for the optimization of deceptive problems
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Lessons from the black-box: fast crossover-based genetic algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A method to derive fixed budget results from expected optimisation times
Proceedings of the 15th annual conference on Genetic and evolutionary computation
How the (1+λ) evolutionary algorithm optimizes linear functions
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Mutation rate matters even when optimizing monotonic functions
Evolutionary Computation
Black-box complexity: from complexity theory to playing mastermind
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Adaptation of a multiagent evolutionary algorithm to NK landscapes
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Test case selection for black-box regression testing of database applications
Information and Software Technology
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
Runtime analysis of the (1+1) EA on computing unique input output sequences
Information Sciences: an International Journal
Annals of Mathematics and Artificial Intelligence
| Hi-index | 5.25 |
Many experimental results are reported on all types of Evolutionary Algorithms but only few results have been proved. A step towards a theory on Evolutionary Algorithms, in particular, the so-called (1+1) Evolutionary Algorithm, is performed. Linear functions are proved to be optimized in expected time O(nlnn) but only mutation rates of size (1/n) can ensure this behavior. For some polynomial of degree 2 the optimization needs exponential time. The same is proved for a unimodal function. Both results were not expected by several other authors. Finally, a hierarchy result is proved. Moreover, methods are presented to analyze the behavior of the (1+1) Evolutionary Algorithm.