메뉴 건너뛰기




Volumn 1, Issue , 2002, Pages 390-395

Comparison of methods for developing dynamic reduced models for design optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EID: 84901429716     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1006266     Document Type: Conference Paper
Times cited : (12)

References (14)
  • 1
    • 0003527507 scopus 로고
    • The utility of nonlinear programming algorithms
    • Ph.D Thesis
    • Eric Sandgren. The utility of nonlinear programming algorithms. Technical report, Purdue University, 1977. Ph.D. Thesis.
    • (1977) Technical Report Purdue University
    • Sandgren, E.1
  • 2
    • 0004006880 scopus 로고    scopus 로고
    • GADO: A genetic algorithm for continuous design optimization
    • The State University of New Jersey, New Brunswick, NJ, January Ph.D. Thesis
    • Khaled Rasheed. GADO: A genetic algorithm for continuous design optimization. Technical Report DCS-TR-352, Department of Computer Science, Rutgers, The State University of New Jersey, New Brunswick, NJ, January 1998. Ph.D. Thesis, http://www.cs.rutgers.edu/~krasheed/thesis.ps.
    • (1998) Technical Report DCS-TR-352, Department of Computer Science, Rutgers
    • Rasheed, K.1
  • 4
    • 0003578240 scopus 로고
    • An empirical study of learning speed in back-propagation networks
    • Carnegie Mellon University
    • Scott E. Fahlmann. An empirical study of learning speed in back-propagation networks. Technical Report CMU-CS-88-162, Carnegie Mellon University, 1988.
    • (1988) Technical Report CMU-CS-88-162
    • Fahlmann, S.E.1
  • 8
    • 0002589996 scopus 로고    scopus 로고
    • Metamodeling techniques for evolutionary optimization of computationally expensive problems: Promises and limitations
    • 13-17 July
    • Mohammed A. El-Beltagy, Prasanth B. Nair, and Andy J. Keane. Metamodeling techniques for evolutionary optimization of computationally expensive problems: Promises and limitations. In Proceedings of the Genetic and Evolutionary Computation Conference, 13-17 July 1999.
    • (1999) Proceedings of the Genetic and Evolutionary Computation Conference
    • El-Beltagy, M.A.1    Nair, P.B.2    Keane, A.J.3
  • 10
    • 0033672380 scopus 로고    scopus 로고
    • An incremental-approximate-clustering approach for developing dynamic reduced models for design optimization
    • Khaled Rasheed. An incremental-approximate-clustering approach for developing dynamic reduced models for design optimization. In Proceedings of the Congress on Evolutionary Computation (CEC), 2000.
    • (2000) Proceedings of the Congress on Evolutionary Computation (CEC)
    • Rasheed, K.1
  • 13
    • 0000982424 scopus 로고
    • Using genetic algorithms in engineering design optimization with non-linear constraints
    • Morgan Kaufmann, July
    • D. Powell and M. Skolnick. Using genetic algorithms in engineering design optimization with non-linear constraints. In Proceedings of the Fifth International Conference on Genetic Algorithms, pages 424-431. Morgan Kaufmann, July 1993.
    • (1993) Proceedings of the Fifth International Conference on Genetic Algorithms , pp. 424-431
    • Powell, D.1    Skolnick, M.2


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