scientific article; zbMATH DE number 1962832
From MaRDI portal
Publication:4418669
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items (35)
A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems ⋮ Variable solution structure can be helpful in evolutionary optimization ⋮ Algorithmic analysis of a basic evolutionary algorithm for continuous optimization ⋮ Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems ⋮ 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 ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ Adaptive drift analysis ⋮ 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 ⋮ Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem ⋮ Multiplicative drift analysis ⋮ Black-box search by unbiased variation ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ 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 ⋮ Fixed-parameter evolutionary algorithms and the vertex cover problem ⋮ Evolutionary algorithms and dynamic programming ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Expected runtimes of evolutionary algorithms for the Eulerian cycle problem ⋮ Runtime analysis of a binary particle swarm optimizer ⋮ How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms ⋮ Runtime analysis of a simple ant colony optimization algorithm ⋮ Comparison of simple diversity mechanisms on plateau functions
This page was built for publication:
