English  |  正體中文  |  简体中文  |  Items with full text/Total items : 17524/19853 (88%)
Visitors : 6394247      Online Users : 673
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.cnu.edu.tw/handle/310902800/27904


    標題: PREACO: A fast ant colony optimization for codebook generation
    作者: Tsai, Chun-Wei
    Tseng, Shih-Pang
    Yang, Chu-Sing
    Chiang, Ming-Chao
    貢獻者: 資訊多媒體應用系
    關鍵字: Ant Colony Optimization
    Codebook Generation Problem
    Pattern Reduction
    日期: 2013-06
    上傳時間: 2014-05-26 10:48:24 (UTC+8)
    出版者: Elsevier Science Bv
    摘要: This paper presents an effective and efficient method for speeding up ant colony optimization (ACO) in solving the codebook generation problem. The proposed method is inspired by the fact that many computations during the convergence process of ant-based algorithms are essentially redundant and thus can be eliminated to boost their convergence speed, especially for large and complex problems. To evaluate the performance of the proposed method, we compare it with several state-of-the-art metaheuristic algorithms. Our simulation results indicate that the proposed method can significantly reduce the computation time of ACO-based algorithms evaluated in this paper while at the same time providing results that match or outperform those ACO by itself can provide. (C) 2013 Elsevier B. V. All rights reserved.
    關聯: Applied Soft Computing, v.13 n.6, pp.3008-3020
    Appears in Collections:[資訊多媒體應用系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML615View/Open


    All items in CNU IR are protected by copyright, with all rights reserved.


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