[1] Benini L, De Micheli G.Networks on Chips: a New SoC Paradigm[J]. Computer, 2002, 35(1): 70-78.
[2] 刘毅, 杨银堂, 周东红. 一种面向片上网络的多时钟路由器设计[J]. 西安电子科技大学学报, 2011, 38(2): 146-150.
Liu Yi, Yang Yintang, Zhou Donghong. Multi-clock Router Designed for the Network-on-chip[J]. Journal of Xidian University, 2011, 38(2): 146-150.
[3] 任向隆, 安建峰, 高德远, 等. 低功耗片上网络映射的遗传及蚂蚁融合算法[J]. 西安交通大学学报, 2012, 37(6): 65-70.
Ren Xianglong, An Jianfeng, Gao Deyuan, et al. Fusion Strategy With Genetic and Ant Algorithms for Low-Power NoC Mapping[J]. Journal of Xi'an Jiaotong University, 2012, 37(6): 65-70.
[4] 董文箫, 沈海斌, 全励, 等. 基于遗传算法的片上网络低功耗映射[J]. 浙江大学学报, 2010, 46(8): 654-656.
Dong Wenxiao, Shen Haibin, Quan Li, et al. Power-aware Mapping Based-on Genetic Algorithm for Network-on-Chip[J]. Journal of Zhejiang University, 2010, 37(6): 654-656.
[5] 杨盛光, 李丽, 高明伦, 等. 面向能耗和延时的NoC映射方法[J]. 电子学报, 2008, 36(5): 937-942.
Yang Shengguang, Li Li, Gao Minglun, et al. An Energy-and Delay-aware Mapping Method of NoC[J]. Acta Electronica Sinica, 2008, 36(5): 937-942.
[6] 张剑贤, 杨银堂, 周端, 等. 自适应混沌遗传退火的片上网络映射[J]. 北京邮电大学学报, 2011, 34(4): 6-9.
Zhang Jianxian, Yang Yintang, Zhou Duan, et al. NoC Mapping of Adaptive Chaos Genetic Annealing[J]. Journal of Beijing University of Posts and Telecommunications, 2011, 34(4): 6-9.
[7] 常政威, 谢晓娜, 桑楠, 等. 片上网络映射问题的改进禁忌搜索算法[J]. 计算机辅助设计与图形学学报, 2008, 20(2): 155-160.
Chang Zhengwei, Xie Xiaona, Sang Nan, et al. An Improved Tabu Search Algorithm for Network-on-Chip Mapping[J]. Journal of Computer-Aided Design & Computer Graphics, 2008, 20(2): 155-160.
[8] 邓植, 顾华玺, 杨银堂, 等. 基于人工蜂群算法的低能耗高性能NoC映射[J]. 西安电子科技大学学报, 2012, 39(2): 137-142.
Deng Zhi, Gu Huaxi, Yang Yintang, et al. Low-energy High-performance Artificial Bee Colony based Mapping Algorithm for NoC[J]. Journal of XiDian University, 2012, 39(2): 137-142.
[9] 张剑贤, 周端, 杨银堂, 等. 一种低能耗的片上网络映射算法[J]. 西安电子科技大学学报, 2011, 38(4): 95-100.
Zhang Jianxian, Zhou Duan, Yang Yintang, et al. Low Energy Consumption Mapping Algorithm for the Network-on-chip[J]. Journal of XiDian University, 2011, 38(4): 95-100.
[10] Eusuff M M, Lansey K E. Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm[J]. Journal of Water Resources Planning and Management, 2003, 129(3): 210-225.
[11] 李英海, 周建中, 杨俊杰, 等. 一种基于阈值选择策略的改进混合蛙跳算法[J]. 计算机工程与应用, 2007, 43(35): 19-21.
Li Yinghai, Zhou Jianzhong, Yang Junjie, et al. Modified Shuffled Frog Leaping Algorithm Based on Threshold Selection Strategy[J]. Computer Engineering and Applications, 2007, 43(35): 19-21.
[12] Chung G, Lansey K. Application of the Shuffled Frog Leaping Algorithm for the Optimization of a General Large-scale Water Supply System[J]. Water Resources Management, 2009, 23(4): 797-823.
[13] Luo Xuehui, Yang Ye, Li Xia. Solving TSP with Shuffled Frog-leaping Algorithm[C]//8th International Conference on Intelligent Systems Design and Applications. Piscataway: IEEE, 2008: 228-232.
[14] Bhaduri A, Bhaduri A. Color Image Segmentation Using Clonal Selection-based Shuffled Frog Leaping Algorithm[C]//ARTCom 2009-International Conference on Advances in Recent Technologies in Communication and Computing. Piscataway: IEEE, 2009: 517-520.
[15] Rahimi-Vahed A, Dangchi M, Rafiei H, et al. A Novel Hybrid Multi-objective Shuffled Frog-leaping Algorithm for a Bi-criteria Permutation Flow Shop Scheduling Problem[J]. International Journal of Advanced Manufacturing Technology, 2009, 41(11-12): 1227-1239.
[16] 罗雪晖, 杨烨, 李霞. 改进混合蛙跳算法求解旅行商问题[J]. 通信学报, 2009, 30(7): 130-135.
Luo Xuehui, Yang Ye, Li Xia. Modified Shuffled Frog-leaping Algorithm to Solve Traveling Salesman Problem[J]. Journal on Communications, 2009, 30(7): 130-135. |