English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51893/87052 (60%)
造訪人次 : 8462060      線上人數 : 75
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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 ©   - 回饋