scientific article; zbMATH DE number 1337869
From MaRDI portal
Publication:4264211
zbMath0943.68060MaRDI QIDQ4264211
Publication date: 16 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling, A new approach to estimating the expected first hitting time of evolutionary algorithms, A mathematical analysis of the long-run behavior of genetic algorithms for social modeling, Runtime analysis of the \((1+1)\) EA on computing unique input output sequences, Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded, A unified framework for population-based metaheuristics, Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties., Convergence of stochastic search algorithms to finite size Pareto set approximations, Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP), On the Foundations and the Applications of Evolutionary Computing, Drift analysis of mutation operations for biogeography-based optimization, Range-based positioning with self-adapting fireworks algorithm for wireless sensor networks, Drift analysis and average time complexity of evolutionary algorithms, Recent advances in evolutionary computation, Theoretical advances in artificial immune systems, Comparing evolutionary algorithms to the (\(1+1\))-EA, Domination landscape in evolutionary algorithms and its applications, Terminating evolutionary algorithms at their steady state, Towards an analytic framework for analysing the computation time of evolutionary algorithms
