• DocumentCode
    1991149
  • Title

    Analysis of implicit parallelism in evolutionary algorithms: a stochastic version

  • Author

    Lixin, Ding ; Lishan, Kang

  • Author_Institution
    State Key Lab. of Software Eng., Wuhan Univ., China
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    172
  • Lastpage
    179
  • Abstract
    Implicit parallelism in evolutionary algorithms is discussed. Under the condition of sampling populations with equal probability, an accurate expression of the expected number of different schemata processed by the evolutionary algorithms in each generation is obtained. Moreover, some kinds of the upper and lower bounds of the expected number are estimated
  • Keywords
    computational complexity; evolutionary computation; parallel algorithms; probability; sampling methods; stochastic processes; evolutionary algorithms; expected number; expected schemata; implicit parallelism analysis; sampling populations; stochastic version; Algorithm design and analysis; Evolutionary computation; Stochastic processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Multimedia Applications, 2001. ICCIMA 2001. Proceedings. Fourth International Conference on
  • Conference_Location
    Yokusika City
  • Print_ISBN
    0-7695-1312-3
  • Type

    conf

  • DOI
    10.1109/ICCIMA.2001.970463
  • Filename
    970463
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1991149