Publication:4418669
From MaRDI portal
zbMath1036.68567MaRDI QIDQ4418669
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070415.htm
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W20: Randomized algorithms
Related Items
Variable solution structure can be helpful in evolutionary optimization, Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax, Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems, Analysis of an iterated local search algorithm for vertex cover in sparse random graphs, On the approximation ability of evolutionary optimization with application to minimum set cover, The use of tail inequalities on the probable computational time of randomized search heuristics, Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem, Practical performance models of algorithms in evolutionary program induction and other domains, Free lunches on the discrete Lipschitz class, Runtime analysis of the 1-ANT ant colony optimizer, Computing minimum cuts by randomized search heuristics, Hybridizing evolutionary algorithms with variable-depth search to overcome local optima, Simplified drift analysis for proving lower bounds in evolutionary computation, Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded, Evolutionary algorithms and dynamic programming, Plateaus can be harder in multi-objective optimization, Evolutionary algorithms and matroid optimization problems, Minimum spanning trees made easier via multi-objective optimization, Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem, Randomized local search, evolutionary algorithms, and the minimum spanning tree problem, Runtime analysis of a binary particle swarm optimizer, Runtime analysis of a simple ant colony optimization algorithm, Comparison of simple diversity mechanisms on plateau functions, A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems, The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate, Adaptive drift analysis, Multiplicative drift analysis, Black-box search by unbiased variation, Fixed-parameter evolutionary algorithms and the vertex cover problem, The runtime of the compact genetic algorithm on jump functions, Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Expected runtimes of evolutionary algorithms for the Eulerian cycle problem, How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
