메뉴 건너뛰기




Volumn 16, Issue 2, 2005, Pages 343-359

On the behavior of parallel genetic algorithms for optimal placement of antennae in telecommunications

Author keywords

Parallel evolutionary algorithm; Performance evaluation; Radio network design

Indexed keywords


EID: 33746253849     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003029     Document Type: Conference Paper
Times cited : (25)

References (20)
  • 2
    • 0032664552 scopus 로고    scopus 로고
    • Bandwidth-demand prediction in virtual path in atm networks using genetic algorithms
    • N. Swaminathan, J. Srinivasan, and S.V. Raghavan. Bandwidth-demand prediction in virtual path in atm networks using genetic algorithms. Computer Commnunications, 22(12):1127-1135, 1999.
    • (1999) Computer Commnunications , vol.22 , Issue.12 , pp. 1127-1135
    • Swaminathan, N.1    Srinivasan, J.2    Raghavan, S.V.3
  • 11
    • 0001842954 scopus 로고
    • A study of reproduction in generational and steady-state genetic algorithms
    • G.J.E. Rawlins, editor, Morgan Kaufmann
    • G. Syswerda. A study of reproduction in generational and steady-state genetic algorithms. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms, pages 94-101. Morgan Kaufmann, 1991.
    • (1991) Foundations of Genetic Algorithms , pp. 94-101
    • Syswerda, G.1
  • 12
    • 0004052111 scopus 로고
    • Users guide to the PGAPack parallel genetic algorithm library
    • Argonne National Laboratory, Mathematics and Computer Science Division, January 31
    • D. Levine. Users guide to the PGAPack parallel genetic algorithm library. Technical Report ANL-95/18, Argonne National Laboratory, Mathematics and Computer Science Division, January 31 1995.
    • (1995) Technical Report , vol.ANL-95-18
    • Levine, D.1
  • 15
    • 0002890519 scopus 로고
    • Structure and performance of fine-grain parallelism in genetic search
    • S. Forrest, editor, Morgan Kaufmann
    • S. Baluja. Structure and performance of fine-grain parallelism in genetic search. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 155-162. Morgan Kaufmann, 1993.
    • (1993) Proceedings of the Fifth International Conference on Genetic Algorithms , pp. 155-162
    • Baluja, S.1
  • 16
    • 0011367639 scopus 로고    scopus 로고
    • Gaining new fields of application for OOP: The parallel evolutionary algorithm case
    • December (web version only)
    • E. Alba and J.M. Troya. Gaining new fields of application for OOP: the parallel evolutionary algorithm case. Journal of Object Oriented Programming, December (web version only) 2001.
    • (2001) Journal of Object Oriented Programming
    • Alba, E.1    Troya, J.M.2
  • 18
    • 0035155449 scopus 로고    scopus 로고
    • Analyzing synchronous and asynchronous parallel distributed genetic algorithms
    • January
    • E. Alba and J.M. Troya. Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Computer Systems, 17:451-465, January 2001.
    • (2001) Future Generation Computer Systems , vol.17 , pp. 451-465
    • Alba, E.1    Troya, J.M.2
  • 19
    • 0037089739 scopus 로고    scopus 로고
    • Parallel evolutionary algorithms can achieve superlinear performance
    • April
    • E. Alba. Parallel evolutionary algorithms can achieve superlinear performance. Information Processing Letters, 82(1):7-13, April 2002.
    • (2002) Information Processing Letters , vol.82 , Issue.1 , pp. 7-13
    • Alba, E.1


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