메뉴 건너뛰기




Volumn 2723, Issue , 2003, Pages 909-921

Analysis of the (1+1) EA for a dynamically bitwise changing ONEMAX

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS;

EID: 35248901569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_103     Document Type: Article
Times cited : (53)

References (14)
  • 1
    • 0003602231 scopus 로고    scopus 로고
    • Th. Bäck, D.B. Fogel, and Z. Michalewicz, editors. Institute of Physics Publishing
    • Th. Bäck, D.B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing, 1997.
    • (1997) Handbook of Evolutionary Computation
  • 3
    • 0031647995 scopus 로고    scopus 로고
    • A rigorous complexity analysis of the (1 + 1) EA for linear functions with Boolean inputs
    • S. Droste, Th. Jansen, and I. Wegener. A rigorous complexity analysis of the (1 + 1) EA for linear functions with Boolean inputs. In Proceedings of ICEC 1998, pages 499-504, 1998.
    • (1998) Proceedings of ICEC 1998 , pp. 499-504
    • Droste, S.1    Jansen, Th.2    Wegener, I.3
  • 4
    • 24944547673 scopus 로고    scopus 로고
    • Dynamic parameter control in simple evolutionary algorithms
    • S. Droste, Th. Jansen, and I. Wegener. Dynamic parameter control in simple evolutionary algorithms. In Proceedings of FOGA 2000, pages 275-294, 2000.
    • (2000) Proceedings of FOGA 2000 , pp. 275-294
    • Droste, S.1    Jansen, Th.2    Wegener, I.3
  • 6
    • 84901417395 scopus 로고    scopus 로고
    • Analysis of the (1+1) EA for a dynamically changing OneMax-variant
    • S. Droste. Analysis of the (1+1) EA for a dynamically changing OneMax-variant. In Proceedings of CEC 2002, pages 55-60, 2002.
    • (2002) Proceedings of CEC 2002 , pp. 55-60
    • Droste, S.1
  • 8
    • 84958045928 scopus 로고    scopus 로고
    • On the analysis of evolutionary algorithms - A proof that crossover really can help
    • Proceedings of ESA 1999
    • Th. Jansen and I. Wegener. On the analysis of evolutionary algorithms - a proof that crossover really can help. In Proceedings of ESA 1999, pages 184-193, 1999. LNCS 1643.
    • (1999) LNCS , vol.1643 , pp. 184-193
    • Jansen, Th.1    Wegener, I.2
  • 9
    • 0000786345 scopus 로고    scopus 로고
    • Real royal road functions - Where crossover is provably essential
    • Th. Jansen and I. Wegener. Real royal road functions - where crossover is provably essential. In Proceedings of GECCO 2001, pages 1034-1041, 2001.
    • (2001) Proceedings of GECCO 2001 , pp. 1034-1041
    • Jansen, Th.1    Wegener, I.2
  • 11
    • 0002091030 scopus 로고
    • How genetic algorithms really work: I. mutation and hill-climbing
    • H. Mühlenbein. How genetic algorithms really work: I. mutation and hill-climbing. In Proceedings of PPSN 1992, pages 15-26, 1992.
    • (1992) Proceedings of PPSN 1992 , pp. 15-26
    • Mühlenbein, H.1
  • 14
    • 84901415974 scopus 로고    scopus 로고
    • (1+1) GA fitness dynamics in a changing environment
    • S.A. Stanhope and J.M. Daida. (1+1) GA fitness dynamics in a changing environment. In Proceedings of the CEC 1999, pages 1851-1858, 1999.
    • (1999) Proceedings of the CEC 1999 , pp. 1851-1858
    • Stanhope, S.A.1    Daida, J.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.