scientific article
From MaRDI portal
Publication:3224100
zbMath1235.90185MaRDI QIDQ3224100
Publication date: 29 March 2012
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789814282673/9789814282673_0001.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ \textsc{OneMax} in black-box models with several restrictions ⋮ Towards a runtime comparison of natural and artificial evolution ⋮ Simple and optimal randomized fault-tolerant rumor spreading ⋮ The impact of random initialization on the runtime of randomized search heuristics ⋮ Stability for vertex cycle covers ⋮ Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ Sublinear Algorithms for Local Graph-Centrality Estimation ⋮ The capture time of the hypercube ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ From black-box complexity to designing new genetic algorithms ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization ⋮ Markov chain analysis of evolutionary algorithms on OneMax function -- from coupon collector's problem to (1 + 1) EA ⋮ The impact of a sparse migration topology on the runtime of island models in dynamic optimization ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ Performance analysis of randomised search heuristics operating with a fixed budget ⋮ A lower bound for the discrepancy of a random point set ⋮ Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints ⋮ Working principles of binary differential evolution ⋮ Efficient randomized test-and-set implementations ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement ⋮ Improving a constant in high-dimensional discrepancy estimates ⋮ Direct Search Based on Probabilistic Descent ⋮ Fitness levels with tail bounds for the analysis of randomized search heuristics
This page was built for publication:
