메뉴 건너뛰기




Volumn , Issue , 2011, Pages 845-852

High dimensions and heavy tails for natural evolution strategies

Author keywords

Black box optimization; Evolution strategies; Global optimization; Natural gradient

Indexed keywords

ATOM CLUSTERS; BLACK-BOX OPTIMIZATION; EVOLUTION STRATEGIES; EVOLUTIONARY OPTIMIZATIONS; GAUSSIANS; HEAVY-TAILED DISTRIBUTION; HEAVY-TAILS; HIGH DIMENSIONS; LENNARD JONES; LOCAL OPTIMA; LOWEST ENERGY STRUCTURE; NATURAL EVOLUTION; NATURAL GRADIENT;

EID: 84860390064     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001692     Document Type: Conference Paper
Times cited : (130)

References (15)
  • 2
    • 0037592480 scopus 로고    scopus 로고
    • Evolution strategies: A comprehensive introduction
    • H.-G. Beyer and H.-P. Schwefel. Evolution strategies: A comprehensive introduction. Natural Computing, 1:3-52, 2002.
    • (2002) Natural Computing , vol.1 , pp. 3-52
    • Beyer, H.-G.1    Schwefel, H.-P.2
  • 6
    • 33845271655 scopus 로고    scopus 로고
    • The CMA evolution strategy: A comparing review
    • DOI 10.1007/11007937-4, Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms
    • N. Hansen. The CMA evolution strategy: a comparing review. In J. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea, editors, Towards a new evolutionary computation. Advances on estimation of distribution algorithms, pages 75-102. Springer, 2006. (Pubitemid 44856937)
    • (2006) Studies in Fuzziness and Soft Computing , vol.192 , pp. 75-102
    • Hansen, N.1
  • 9
    • 0035377566 scopus 로고    scopus 로고
    • Completely derandomized self-adaptation in evolution strategies
    • N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159-195, 2001.
    • (2001) Evolutionary Computation , vol.9 , Issue.2 , pp. 159-195
    • Hansen, N.1    Ostermeier, A.2
  • 10
    • 56449130100 scopus 로고    scopus 로고
    • A simple modification in CMA-ES achieving linear time and space complexity
    • R. et al., editor PPSN X Springer
    • R. Ros and N. Hansen. A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity. In R. et al., editor, Parallel Problem Solving from Nature, PPSN X, pages 296-305. Springer, 2008.
    • (2008) Parallel Problem Solving from Nature , pp. 296-305
    • Ros, R.1    Hansen, N.2
  • 14
    • 0000560869 scopus 로고    scopus 로고
    • Global optimization by basin-hopping and the lowest energy structures of lennard-jones clusters containing up to 110 atoms
    • D. Wales and J. Doye. Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms. The Journal of Physical Chemistry A, 101(28):8, 1998.
    • (1998) The Journal of Physical Chemistry A , vol.101 , Issue.28 , pp. 8
    • Wales, D.1    Doye, J.2


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