The following pages link to STACS 2005 (Q5710700):
Displayed 33 items.
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- Runtime analysis of the 1-ANT ant colony optimizer (Q633703) (← links)
- Computing minimum cuts by randomized search heuristics (Q633832) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Evolutionary algorithms and dynamic programming (Q652137) (← links)
- Plateaus can be harder in multi-objective optimization (Q847662) (← links)
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem (Q877664) (← links)
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (Q884444) (← links)
- Ant colony optimization and the minimum spanning tree problem (Q974104) (← links)
- Runtime analysis of a binary particle swarm optimizer (Q974120) (← links)
- Runtime analysis of a simple ant colony optimization algorithm (Q1022344) (← links)
- Comparison of simple diversity mechanisms on plateau functions (Q1029353) (← links)
- The impact of parametrization in memetic evolutionary algorithms (Q1029357) (← links)
- Towards implementation of a generalized architecture for high-level quantum programming language (Q1700813) (← links)
- Fixed-parameter evolutionary algorithms and the vertex cover problem (Q1949737) (← links)
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
- Exponential upper bounds for the runtime of randomized search heuristics (Q2220808) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem (Q2321315) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas (Q2362359) (← links)
- Towards a runtime comparison of natural and artificial evolution (Q2362364) (← links)
- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem (Q2475838) (← links)
- How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms (Q2503340) (← links)
- Population size versus runtime of a simple evolutionary algorithm (Q2518379) (← links)
- Drift conditions for estimating the first hitting times of evolutionary algorithms (Q5391462) (← links)
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations (Q6095506) (← links)
- Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution (Q6182676) (← links)
- Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem (Q6185935) (← links)