메뉴 건너뛰기




Volumn 16, Issue 1, 2003, Pages 41-47

A mixed evolutionary-statistical analysis of an algorithm's complexity

Author keywords

Algorithms; Computational complexity; Evolutionary computing; Statistical analysis

Indexed keywords


EID: 84867937106     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(02)00142-8     Document Type: Article
Times cited : (13)

References (7)
  • 2
    • 14244260378 scopus 로고    scopus 로고
    • A statistical analysis of an algorithm's complexity
    • S. Chakraborty, and P. Choudhury A statistical analysis of an algorithm's complexity Appl. Math. Lett. 13 5 2000 121 126
    • (2000) Appl. Math. Lett. , vol.13 , Issue.5 , pp. 121-126
    • Chakraborty, S.1    Choudhury, P.2
  • 4
    • 0032009349 scopus 로고    scopus 로고
    • Genetic forma recombination in permutation flowshop problems
    • C. Cotta, and J. Troya Genetic forma recombination in permutation flowshop problems Evolutionary Computation 6 1 1998 25 44 (Pubitemid 128692720)
    • (1998) Evolutionary Computation , vol.6 , Issue.1 , pp. 25-44
    • Cotta, C.1    Troya, J.M.2
  • 7
    • 84914724052 scopus 로고
    • A high-speed sorting procedure
    • D. Shell A high-speed sorting procedure Communications of the ACM 2 1959 30 32
    • (1959) Communications of the ACM , vol.2 , pp. 30-32
    • Shell, D.1


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