메뉴 건너뛰기




Volumn 4193 LNCS, Issue , 2006, Pages 788-797

Performance of evolutionary algorithms on random decomposable problems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 33750274443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_80     Document Type: Conference Paper
Times cited : (13)

References (23)
  • 2
    • 0041822908 scopus 로고
    • Analyzing deception in trap functions
    • University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL
    • Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. IlliGAL Report No. 91009, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL (1991)
    • (1991) IlliGAL Report No. 91009
    • Deb, K.1    Goldberg, D.E.2
  • 5
    • 0001078074 scopus 로고
    • Morphology of ground states of a two dimensional frustration model
    • Barahona, F., Maynard, R., Rammal, R., Uhry, J.: Morphology of ground states of a two dimensional frustration model. J. Phys. A 15 (1982) 673
    • (1982) J. Phys. A , vol.15 , pp. 673
    • Barahona, F.1    Maynard, R.2    Rammal, R.3    Uhry, J.4
  • 6
    • 19044391501 scopus 로고
    • The Euclidean travelling salesman problem is NP-complete
    • Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science 4 (1977) 237-244
    • (1977) Theoretical Computer Science , vol.4 , pp. 237-244
    • Papadimitriou, C.H.1
  • 9
    • 0001697862 scopus 로고
    • Local properties of kauffman's N-k model: A tunably rugged enegy landscape
    • Weinberger, E.D.: Local properties of kauffman's N-k model: A tunably rugged enegy landscape. Physical Review A 44(10) (1991) 6399-6413
    • (1991) Physical Review A , vol.44 , Issue.10 , pp. 6399-6413
    • Weinberger, E.D.1
  • 10
    • 84958959530 scopus 로고    scopus 로고
    • From recombination of genes to the estimation of distributions I. Binary parameters
    • Mühlenbein, H., Paaß, G.: From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature (1996) 178-187
    • (1996) Parallel Problem Solving from Nature , pp. 178-187
    • Mühlenbein, H.1    Paaß, G.2
  • 13
    • 0003984832 scopus 로고
    • Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
    • Carnegie Mellon University, Pittsburgh, PA
    • Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA (1994)
    • (1994) Tech. Rep. No. CMU-CS-94-163 , vol.CMU-CS-94-163
    • Baluja, S.1
  • 19
    • 0002091030 scopus 로고
    • How genetic algorithms really work: I.Mutation and Hillclimbing
    • Männer, R., Manderick, B., eds. Amsterdam, Netherlands, Elsevier Science
    • Mühlenbein, H.: How genetic algorithms really work: I.Mutation and Hillclimbing. In Männer, R., Manderick, B., eds.: Parallel Problem Solving from Nature, Amsterdam, Netherlands, Elsevier Science (1992) 15-25
    • (1992) Parallel Problem Solving from Nature , pp. 15-25
    • Mühlenbein, H.1
  • 21
    • 22944491997 scopus 로고    scopus 로고
    • The design of innovation: Lessons from and for competent genetic algorithms
    • Kluwer Academic Publishers
    • Goldberg, D.E.: The design of innovation: Lessons from and for competent genetic algorithms. Volume 7 of Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers (2002)
    • (2002) Genetic Algorithms and Evolutionary Computation , vol.7
    • Goldberg, D.E.1


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