Chia Nan University of Pharmacy & Science Institutional Repository:Item 310902800/27904
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 18076/20274 (89%)
造访人次 : 4629688      在线人数 : 1294
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://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
    显示于类别:[多媒體與遊戲發展系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML1922检视/开启


    在CNU IR中所有的数据项都受到原著作权保护.

    TAIR相关文章

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