Dandelion-Encoded Harmony Search Heuristics for Opportunistic Traffic Offloading in Synthetically Modeled Mobile Networks
暂无分享,去创建一个
Javier Del Ser | Sancho Salcedo-Sanz | Cristina Perfecto | Miren Nekane Bilbao | Armando Ferro | J. Ser | S. Salcedo-Sanz | Cristina Perfecto | A. Ferro
[1] Charles C. Palmer,et al. Representing trees in genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[2] Zong Woo Geem,et al. A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..
[3] David K. Smith,et al. Recent Advances in the Study of the Dandelion Code, Happy Code, and Blob Code Spanning Tree Representations , 2006, 2006 IEEE International Conference on Evolutionary Computation.
[4] Saverio Caminiti,et al. Parallel Algorithms for Dandelion-Like Codes , 2009, ICCS.
[5] Aravind Srinivasan,et al. Cellular traffic offloading through opportunistic communications: a case study , 2010, CHANTS '10.
[6] Hamid Aghvami,et al. On Mobile Data Offloading Policies in Heterogeneous Wireless Networks , 2013, 2013 IEEE 77th Vehicular Technology Conference (VTC Spring).
[7] Hamid Aghvami,et al. A survey on mobile data offloading: technical and business perspectives , 2013, IEEE Wireless Communications.
[8] Zong Woo Geem,et al. A survey on applications of the harmony search algorithm , 2013, Eng. Appl. Artif. Intell..
[9] Yacine Ghamri-Doudane,et al. Managing the decision-making process for opportunistic mobile data offloading , 2014, 2014 IEEE Network Operations and Management Symposium (NOMS).
[10] S. Picciotto. How to encode a tree , 2017, 1710.08463.