메뉴 건너뛰기




Volumn 1141, Issue , 1996, Pages 398-407

Every niching method has its niche: Fitness sharing and implicit sharing compared

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; HEALTH;

EID: 84958949201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1004     Document Type: Conference Paper
Times cited : (54)

References (22)
  • 1
    • 0001980141 scopus 로고
    • The evolution of strategies in the iterated prisoner’s dilemma
    • Morgan Kauffman
    • R. Axelrod. The evolution of strategies in the iterated prisoner’s dilemma. In Genetic Algorithms and Simulated Annealing, pages 32-41. Morgan Kauffman, 1987.
    • (1987) Genetic Algorithms and Simulated Annealing , pp. 32-41
    • Axelrod, R.1
  • 3
    • 84958976798 scopus 로고
    • On evolving robust strategies for iterated prisoner’s dilemma
    • Springer
    • P. Darwen and X. Yao. On evolving robust strategies for iterated prisoner’s dilemma. In Progress in Evolutionary Computation, pages 276-292. Springer, 1995.
    • (1995) Progress in Evolutionary Computation , pp. 276-292
    • Darwen, P.1    Yao, X.2
  • 5
    • 0002284602 scopus 로고
    • An investigation of niche and species formation in genetic function optimization
    • June
    • K. Deb and D. E. Goldberg. An investigation of niche and species formation in genetic function optimization. In ICGA-3, pages 42-50, June 1989.
    • (1989) ICGA-3 , pp. 42-50
    • Deb, K.1    Goldberg, D.E.2
  • 6
    • 0000283841 scopus 로고
    • Preventing premature confergence in genetic algorithms by preventing incest
    • L. J. Eshelman and J. D. Schaffer. Preventing premature confergence in genetic algorithms by preventing incest. In ICGA-4, pages 115-122, 1991.
    • (1991) ICGA-4 , pp. 115-122
    • Eshelman, L.J.1    Schaffer, J.D.2
  • 7
    • 0000735587 scopus 로고
    • First nearest neighbor classification problem on Frey and Slate’s letter recognition problem
    • Oct
    • T. C. Fogarty. First nearest neighbor classification problem on Frey and Slate’s letter recognition problem. Machine Learning, 9(4):387-388, Oct. 1992.
    • (1992) Machine Learning , vol.9 , Issue.4 , pp. 387-388
    • Fogarty, T.C.1
  • 8
    • 0001351468 scopus 로고
    • Using genetic algorithms to explore pattern recognition in the immune system
    • S. Forrest, B. Javornik, R. E. Smith, and A. S. Perelson. Using genetic algorithms to explore pattern recognition in the immune system. Evolutionary Computation, 1 (3): 191-211, 1993.
    • (1993) Evolutionary Computation , vol.1 , Issue.3 , pp. 191-211
    • Forrest, S.1    Javornik, B.2    Smith, R.E.3    Perelson, A.S.4
  • 9
    • 0026120634 scopus 로고
    • Letter recognition using Holland-style adaptive classifiers
    • Mar
    • P. Frey and D. Slate. Letter recognition using Holland-style adaptive classifiers. Machine Learning, 6(2):161-182, Mar. 1991.
    • (1991) Machine Learning , vol.6 , Issue.2 , pp. 161-182
    • Frey, P.1    Slate, D.2
  • 10
    • 84959007436 scopus 로고
    • Genetic Algorithms in Search, Optimization, and Machine Learn­ing. Addison-Wesley
    • D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learn­ing. Addison-Wesley, 1989.
    • (1989)
    • Goldberg, D.E.1
  • 15
    • 0029716705 scopus 로고    scopus 로고
    • A clearing procedure as a niching method for genetic algorithms
    • A. Pétrowski. A clearing procedure as a niching method for genetic algorithms. In IEEE Conference on Evolutionary Computation, pages 798-803, 1996.
    • (1996) In IEEE Conference on Evolutionary Computation , pp. 798-803
    • Pétrowski, A.1
  • 17
    • 0003986643 scopus 로고
    • Methods for competitive co-evolution: Finding opponents worth beating
    • C. D. Rosin and R. K. Belew. Methods for competitive co-evolution: Finding opponents worth beating. In ICGA-6, pages 373-380, 1995.
    • (1995) ICGA-6 , pp. 373-380
    • Rosin, C.D.1    Belew, R.K.2
  • 18
    • 84969395837 scopus 로고
    • Racial harmony and function optimization in genetic algorithms
    • C. Ryan. Racial harmony and function optimization in genetic algorithms. In 1995 Evolutionary Programming Conference, pages 296-307, 1995.
    • (1995) 1995 Evolutionary Programming Conference , pp. 296-307
    • Ryan, C.1
  • 20
    • 0001351468 scopus 로고
    • Searching for diverse, cooperative populations with genetic algorithms
    • R. E. Smith, S. Forrest, and A. S. Perelson. Searching for diverse, cooperative populations with genetic algorithms. Evolutionary Computation, 1:127-149, 1992.
    • (1992) Evolutionary Computation , vol.1 , pp. 127-149
    • Smith, R.E.1    Forrest, S.2    Perelson, A.S.3
  • 21
    • 3843080754 scopus 로고
    • Co-adaptive genetic algorithms: An example in Othello strategy
    • R. E. Smith and B. Gray. Co-adaptive genetic algorithms: An example in Othello strategy. In 1994 Florida AI Research Symposium, pages 259-264, 1994.
    • (1994) 1994 Florida AI Research Symposium , pp. 259-264
    • Smith, R.E.1    Gray, B.2


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