Pages that link to "Item:Q1768779"
From MaRDI portal
The following pages link to A study of drift analysis for estimating computation time of evolutionary algorithms (Q1768779):
Displaying 50 items.
- Robustness of populations in stochastic environments (Q306488) (← links)
- Concentration of first hitting times under additive drift (Q306489) (← links)
- Crossover can be constructive when computing unique input-output sequences (Q416273) (← links)
- A large population size can be unhelpful in evolutionary algorithms (Q428903) (← links)
- Non-existence of linear universal drift functions (Q428906) (← links)
- The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911) (← links)
- Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front (Q433024) (← links)
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances (Q477078) (← links)
- Drift analysis of mutation operations for biogeography-based optimization (Q521639) (← links)
- The time complexity analysis of a class of gene expression programming (Q521683) (← links)
- Analyzing different variants of immune inspired somatic contiguous hypermutations (Q627102) (← links)
- Simplified drift analysis for proving lower bounds in evolutionary computation (Q633834) (← links)
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded (Q633837) (← links)
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems (Q781286) (← links)
- Towards an analytic framework for analysing the computation time of evolutionary algorithms (Q814443) (← links)
- Choosing selection pressure for wide-gap problems (Q847671) (← links)
- A rigorous analysis of the compact genetic algorithm for linear functions (Q862957) (← links)
- Runtime analysis of the \((1+1)\) EA on computing unique input output sequences (Q903582) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints (Q1725656) (← links)
- Island models meet rumor spreading (Q1725662) (← links)
- Adaptive drift analysis (Q1939672) (← links)
- Multiplicative drift analysis (Q1945169) (← links)
- Black-box search by unbiased variation (Q1945171) (← links)
- Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA (Q1989355) (← links)
- Optimal parameter choices via precise black-box analysis (Q2007714) (← links)
- Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints (Q2182714) (← links)
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms (Q2211362) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- Multiplicative up-drift (Q2240128) (← links)
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint (Q2240133) (← links)
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm (Q2250995) (← links)
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming (Q2306017) (← links)
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time (Q2306019) (← links)
- First-hitting times under drift (Q2333786) (← links)
- On easiest functions for mutation operators in bio-inspired optimisation (Q2362365) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- A new approach to estimating the expected first hitting time of evolutionary algorithms (Q2389686) (← links)
- Evolutionary algorithms for quantum computers (Q2441596) (← links)
- Recent advances in evolutionary computation (Q2508374) (← links)
- Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem (Q2661992) (← links)
- A tight runtime analysis for the \((\mu + \lambda)\) EA (Q2661996) (← links)
- The complex parameter landscape of the compact genetic algorithm (Q2661997) (← links)
- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata (Q2866110) (← links)
- Drift Analysis and Evolutionary Algorithms Revisited (Q3177365) (← links)
- Self-stabilizing Cuts in Synchronous Networks (Q3511402) (← links)
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links (Q3639488) (← links)
- Theoretical Analysis of Local Search in Software Testing (Q3646126) (← links)
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions (Q4911174) (← links)
- Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions (Q5081786) (← links)
