English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49258/83761 (59%)
Visitors : 7139134      Online Users : 55
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/38680


    Title: Effective Approaches for Constructing Fault-Tolerant Communication Trees in Hypercubes
    Authors: Chuang, Po-Jen;Chen, Shih-Yuan;Chen, Juei-Tang
    Contributors: 淡江大學電機工程學系
    Keywords: 容錯;通訊樹;超立方;遺傳演算法;模擬退火;Fault Tolerance;Communication Tree;Hypercube;Genetic Algorithm;Simulated Annealing
    Date: 2002
    Issue Date: 2013-03-07 14:55:44 (UTC+8)
    Abstract: Two random search techniques, the genetic algorithm (GA) and the simulated annealing (SA) approaches, are used to construct fault-tolerant communication trees with the lowest data transmission time in this paper. Experimental evaluation shows that with reasonably low search time, the GA and SA approaches are able to find more desirable communication trees, i.e., trees with less data transmission time, than the minimal cost approach. Also provided is a distributed approach with two algorithms able to further reduce search time for the GA and SA approaches due to parallel search for communication subtrees in disjoint subcubes.
    Relation: Proceedings of the 2002 International Computer Symposium (Volume I)=二00二年國際計算機會議論文集(I), pp.245-252
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    There are no files associated with this item.

    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