The following pages link to Pietro S. Oliveto (Q477081):
Displayed 18 items.
- Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change (Q477083) (← links)
- Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834) (← links)
- Improved time complexity analysis of the simple genetic algorithm (Q888423) (← links)
- On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements? (Q1725659) (← links)
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism (Q1750360) (← links)
- Tight bounds on the expected runtime of a standard steady state genetic algorithm (Q2144273) (← links)
- When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms (Q2182726) (← links)
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms (Q2211362) (← links)
- On the runtime analysis of the simple genetic algorithm (Q2250994) (← links)
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem (Q2321315) (← links)
- On easiest functions for mutation operators in bio-inspired optimisation (Q2362365) (← links)
- On the benefits and risks of using fitness sharing for multimodal optimisation (Q2415319) (← links)
- On the impact of the performance metric on efficient algorithm configuration (Q2667810) (← links)
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not (Q2680763) (← links)
- On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions (Q4972727) (← links)
- Automatic adaptation of hypermutation rates for multimodal optimisation (Q5075412) (← links)
- Approximating vertex cover using edge-based representations (Q5276116) (← links)
- (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error (Q6161501) (← links)