淡江大學機構典藏:Item 987654321/38680
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 60861/93638 (65%)
造访人次 : 1113118      在线人数 : 31
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/38680


    题名: Effective Approaches for Constructing Fault-Tolerant Communication Trees in Hypercubes
    作者: Chuang, Po-Jen;Chen, Shih-Yuan;Chen, Juei-Tang
    贡献者: 淡江大學電機工程學系
    关键词: 容錯;通訊樹;超立方;遺傳演算法;模擬退火;Fault Tolerance;Communication Tree;Hypercube;Genetic Algorithm;Simulated Annealing
    日期: 2002
    上传时间: 2013-03-07 14:55:44 (UTC+8)
    摘要: 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.
    關聯: Proceedings of the 2002 International Computer Symposium (Volume I)=二00二年國際計算機會議論文集(I), pp.245-252
    显示于类别:[電機工程學系暨研究所] 會議論文

    文件中的档案:

    没有与此文件相关的档案.

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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