메뉴 건너뛰기




Volumn 1447, Issue , 1998, Pages 282-290

On making problems evolutionarily friendly Part 2: Evolving the most convenient coordinate systems within which to pose (and solve) the given problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; GRADIENT METHODS; LIME;

EID: 84947765852     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0040781     Document Type: Conference Paper
Times cited : (2)

References (10)
  • 3
    • 0031221187 scopus 로고    scopus 로고
    • Evolving computer programs without subtree crossover
    • Sept. 1997
    • Chellapilla K (1997b), "Evolving computer programs without subtree crossover," IEEE Tram. On Evolutionary Computation, vol. 1, No. 3, pp. 209-216. Sept. 1997.
    • (1997) IEEE Tram. On Evolutionary Computation , vol.1 , Issue.3 , pp. 209-216
    • Chellapilla, K.1
  • 4
    • 0028427635 scopus 로고
    • Asymptotic convergence properties of genetic algorithms and evolutionary programming: Analysis and experiments
    • Fogel DB (1994), "Asymptotic convergence properties of genetic algorithms and evolutionary programming: analysis and experiments," Cybernetics and Systems, vol. 25:3, pp. 389-407.
    • (1994) Cybernetics and Systems , vol.25 , Issue.3 , pp. 389-407
    • Fogel, D.B.1
  • 8
    • 0028203106 scopus 로고
    • Convergence analysis of canonical genetic algorithms
    • Rudolph G (1994), "Convergence analysis of canonical genetic algorithms," IEEE Trans. Neural Networks, vol 5:1, pp. 96-101.
    • (1994) IEEE Trans. Neural Networks , vol.5 , Issue.1 , pp. 96-101
    • Rudolph, G.1
  • 9
    • 0004112038 scopus 로고
    • Reading, MA: Addison-Wesley, 1988
    • Sidgewick R (1988) Algorithms, Reading, MA: Addison-Wesley, 1988.
    • (1988) Algorithms
    • Sidgewick, R.1


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