English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52052/87180 (60%)
Visitors : 8894326      Online Users : 45
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106409

    Title: Analysis of Parallel Sub-swarm PSO with the Same Total Particle Numbers
    Authors: Hong, T. P.;Chen, J. C.;Lin, W. Y.;Chen, C. H.
    Keywords: parallel processing;particle number;particle swarm optimization;sub-swarm
    Date: 2015-09-03
    Issue Date: 2016-04-27 11:12:08 (UTC+8)
    Publisher: IEEE
    Abstract: In this paper, we re-visit the parallel PSO schemes and adopt a different perspective to parallelize PSO. In the adopted scheme, the original particle swarm is divided into several sub-swarms under the condition that the total particle numbers are the same, thus keeping nearly the same computational tasks. Each slave processor then individually runs a part of the sub-swarms. Experiments are also conducted to show the property and the performance of the scheme.
    Relation: Network-Based Information Systems (NBiS), 2015 18th International Conference, pp.616-619
    DOI: 10.1109/NBiS.2015.92
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    NBiS-INCoS-2015-full-program-v14.pdf議程5451KbAdobe PDF9View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback