메뉴 건너뛰기




Volumn 31, Issue 4, 2004, Pages 551-556

Immune monoclonal strategy based on the Cauthy mutation

Author keywords

Cauthy mutation; Clonal selection; Evolutionary algorithms; Evolutionary strategies; Markov chain

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION;

EID: 7244248877     PISSN: 10012400     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (8)

References (15)
  • 2
    • 7244224145 scopus 로고    scopus 로고
    • Chinese source
  • 3
    • 7244227146 scopus 로고    scopus 로고
    • Chinese source
  • 4
    • 7244253804 scopus 로고    scopus 로고
    • Chinese source
  • 5
    • 0025182492 scopus 로고
    • Comparing genetic operators with Gaussian mutations in simulated evolutionary processing using linear systems
    • Fogel D B, Atmar J W. Comparing Genetic Operators with Gaussian Mutations in Simulated Evolutionary Processing Using Linear Systems [J]. Biological Cybernetics, 1993, 63(2): 111-114.
    • (1993) Biological Cybernetics , vol.63 , Issue.2 , pp. 111-114
    • Fogel, D.B.1    Atmar, J.W.2
  • 7
    • 0023669879 scopus 로고
    • Nonconvex optimization by fast simulated annealing
    • Szu H H, Hartley R L. Nonconvex Optimization by Fast Simulated Annealing [J]. Proceeding of IEEE, 1987, 75(3): 1538-1540.
    • (1987) Proceeding of IEEE , vol.75 , Issue.3 , pp. 1538-1540
    • Szu, H.H.1    Hartley, R.L.2
  • 8
    • 0006620823 scopus 로고    scopus 로고
    • Are evolutionary algorithms improved by larger mutations
    • Berlin: Springer-Verlag
    • Kappler C. Are Evolutionary Algorithms Improved by Larger Mutations? [A]. In Parallel Problem Solving from Nature (PPSN) IV [C]. Berlin: Springer-Verlag, 1996. 346-355.
    • (1996) Parallel Problem Solving from Nature (PPSN) IV , pp. 346-355
    • Kappler, C.1
  • 9
    • 0029483565 scopus 로고
    • A new simulated annealing algorithms
    • Yao X. A New Simulated Annealing Algorithms [J]. Int J of Computer Math, 1995, 56(1): 162-168.
    • (1995) Int J of Computer Math , vol.56 , Issue.1 , pp. 162-168
    • Yao, X.1
  • 11
    • 84955604921 scopus 로고    scopus 로고
    • An analysis of evolutionary algorithms based on neighbourhood and step sizes
    • Berlin: Springer-Veralg
    • Yao X, Lin G, Liu Y. An Analysis of Evolutionary Algorithms Based on Neighbourhood and Step Sizes [A]. Proc of the Sixth Annual Conference on Evolutionary Programming [C]. Berlin: Springer-Veralg, 1997. 297-307.
    • (1997) Proc of the Sixth Annual Conference on Evolutionary Programming , pp. 297-307
    • Yao, X.1    Lin, G.2    Liu, Y.3
  • 12
    • 7244220768 scopus 로고    scopus 로고
    • Chinese source
  • 14
    • 7244249487 scopus 로고    scopus 로고
    • Chinese source
  • 15
    • 0026224611 scopus 로고
    • The parallel genetic algorithm as function optimizer
    • Muhlenbein H, Schomisch M, Born J. The Parallel Genetic Algorithm as Function Optimizer [J]. Parallel Computing, 19981, 17(6): 619-632.
    • (1981) Parallel Computing , vol.17 , Issue.6 , pp. 619-632
    • Muhlenbein, H.1    Schomisch, M.2    Born, J.3


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