-
2
-
-
77955890399
-
Multiplicative drift analysis
-
ACM
-
Doerr, B., Johannsen, D., and Winzen, C. (2010a). Multiplicative drift analysis. In Proceedings of the 12th annual conference on Genetic and evolutionary computation, GECCO '10, pages 1449-1456. ACM.
-
(2010)
Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO '10
, pp. 1449-1456
-
-
Doerr, B.1
Johannsen, D.2
Winzen, C.3
-
3
-
-
77955890399
-
Multiplicative drift analysis
-
New York, NY, USA ACM
-
Doerr, B., Johannsen, D., and Winzen, C. (2010b). Multiplicative drift analysis. In GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation, pages 1449-1456, New York, NY, USA. ACM.
-
(2010)
GECCO '10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation
, pp. 1449-1456
-
-
Doerr, B.1
Johannsen, D.2
Winzen, C.3
-
4
-
-
0032082507
-
A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs
-
Droste, S., Jansen, T., and Wegener, I. (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs. Evolutionary Computation, 6(2):185-196.
-
(1998)
Evolutionary Computation
, vol.6
, Issue.2
, pp. 185-196
-
-
Droste, S.1
Jansen, T.2
Wegener, I.3
-
7
-
-
0001108744
-
Hitting-time and occupation-time bounds implied by drift analysis with applications
-
Hajek, B. (1982). Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 13(3):502-525.
-
(1982)
Advances in Applied Probability
, vol.13
, Issue.3
, pp. 502-525
-
-
Hajek, B.1
-
8
-
-
0035276208
-
Drift analysis and average time complexity of evolutionary algorithms
-
He, J. and Yao, X. (2001). Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):57-85.
-
(2001)
Artificial Intelligence
, vol.127
, Issue.1
, pp. 57-85
-
-
He, J.1
Yao, X.2
-
9
-
-
4344644853
-
A study of drift analysis for estimating computation time of evolutionary algorithms
-
He, J. and Yao, X. (2004). A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing: an international journal, 3(1):21-35.
-
(2004)
Natural Computing: An International Journal
, vol.3
, Issue.1
, pp. 21-35
-
-
He, J.1
Yao, X.2
-
11
-
-
0035694032
-
Evolutionary algorithms - How to cope with plateaus of constant fitness and when to reject strings of the same fitness
-
Jansen, T. and Wegener, I. (2001). Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Computation, 5(6):589-599.
-
(2001)
IEEE Trans. Evolutionary Computation
, vol.5
, Issue.6
, pp. 589-599
-
-
Jansen, T.1
Wegener, I.2
-
16
-
-
78549238266
-
Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
-
Mitavskiy, B., Rowe, J. E., and Cannings, C. (2009). Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. International Journal of Intelligent Computing and Cybernetics, 2(2):243-284.
-
(2009)
International Journal of Intelligent Computing and Cybernetics
, vol.2
, Issue.2
, pp. 243-284
-
-
Mitavskiy, B.1
Rowe, J.E.2
Cannings, C.3
-
17
-
-
79951672635
-
Simplified drift analysis for proving lower bounds inevolutionary computation
-
Oliveto, P. S. and Witt, C. (2011). Simplified drift analysis for proving lower bounds inevolutionary computation. Algorithmica, 59(3):369-386.
-
(2011)
Algorithmica
, vol.59
, Issue.3
, pp. 369-386
-
-
Oliveto, P.S.1
Witt, C.2
-
18
-
-
0345506717
-
-
Kluwer Academic Publishers, Norwell, MA, USA
-
Reeves, C. R. and Rowe, J. E. (2002). Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory. Kluwer Academic Publishers, Norwell, MA, USA.
-
(2002)
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
-
-
Reeves, C.R.1
Rowe, J.E.2
-
19
-
-
0003059188
-
Finite markov chain results in evolutionary computation: A tour d'horizon
-
Rudolph, G. (1998). Finite Markov chain results in evolutionary computation: A tour d'horizon. Fundamenta Informaticae, 35(1-4):67-89.
-
(1998)
Fundamenta Informaticae
, vol.35
, Issue.1-4
, pp. 67-89
-
-
Rudolph, G.1
-
21
-
-
78149234218
-
General lower bounds for the running time of evolutionary algorithms
-
Sudholt, D. (2010). General lower bounds for the running time of evolutionary algorithms. In PPSN (1), pages 124-133.
-
(2010)
PPSN
, Issue.1
, pp. 124-133
-
-
Sudholt, D.1
-
23
-
-
34547424668
-
Runtime analysis of the (μ+1) EA on simple pseudo-boolean functions evolutionary computation
-
New York, NY, USA ACM Press
-
Witt, C. (2006). Runtime analysis of the (μ+1) ea on simple pseudo-boolean functions evolutionary computation. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 651-658, New York, NY, USA. ACM Press.
-
(2006)
GECCO '06: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation
, pp. 651-658
-
-
Witt, C.1
-
24
-
-
84880318417
-
Optimizing linear functions with randomized search heuristics - The robustness of mutation
-
Durr, C. and Wilke, T. editors, Dagstuhl, Germany, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
-
Witt, C. (2012). Optimizing linear functions with randomized search heuristics - The robustness of mutation. In Durr, C. and Wilke, T., editors, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), Leibniz International Proceedings in Informatics (LIPIcs), pages 420-431, Dagstuhl, Germany. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
-
(2012)
29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), Leibniz International Proceedings in Informatics (LIPIcs)
, pp. 420-431
-
-
Witt, C.1
|