STACS 2005
From MaRDI portal
Publication:5710700
DOI10.1007/b106485zbMath1118.68658OpenAlexW4230940848MaRDI QIDQ5710700
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ Towards a runtime comparison of natural and artificial evolution ⋮ Plateaus can be harder in multi-objective optimization ⋮ An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee ⋮ 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 ⋮ Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations ⋮ 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 ⋮ Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution ⋮ Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem ⋮ Towards implementation of a generalized architecture for high-level quantum programming language ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ 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 ⋮ Fixed-parameter evolutionary algorithms and the vertex cover problem ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Evolutionary algorithms and dynamic programming ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ Drift conditions for estimating the first hitting times of evolutionary algorithms ⋮ Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ Expected runtimes of evolutionary algorithms for the Eulerian cycle problem ⋮ Ant colony optimization and the minimum spanning tree problem ⋮ Runtime analysis of a binary particle swarm optimizer ⋮ How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms ⋮ Population size versus runtime of a simple evolutionary algorithm ⋮ Runtime analysis of a simple ant colony optimization algorithm ⋮ Comparison of simple diversity mechanisms on plateau functions ⋮ The impact of parametrization in memetic evolutionary algorithms ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem ⋮ Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
