{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:17:18Z","timestamp":1729671438485,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/icitcs.2015.7293008","type":"proceedings-article","created":{"date-parts":[[2015,10,8]],"date-time":"2015-10-08T21:57:27Z","timestamp":1444341447000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Strategies for Harmony Search on CUDA to Solve Traveling Salesman Problem"],"prefix":"10.1109","author":[{"given":"Kang Chian","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosni","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.01.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2013.09.007"},{"journal-title":"NVIDIA Nvidia's Next Generation CUDA Compute Architecture Fermi","year":"2009","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/IPDPS.2010.5470477","article-title":"Inter-block gpu communication via fast barrier synchronization","author":"xiao","year":"2010","journal-title":"Proceedings of International Symposium on Parallel & Distributed Processing (IPDPS 2010)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500467430"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2013.05.008"},{"journal-title":"The Traveling Salesman Problem A Computational Study","year":"2006","author":"applegate","key":"ref3"},{"key":"ref6","first-page":"1","article-title":"A gpu-based harmony k-means algorithm for document clustering","author":"gao","year":"2012","journal-title":"Proceedings of International Conference on Information Science and Control Engineering (ICISCE 2012)"},{"key":"ref5","first-page":"154","article-title":"Adaptation of the harmony search to solve the travelling salesman problem","volume":"62","author":"bouzidi","year":"2014","journal-title":"Journal of Theoretical and Applied Information Technology"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CCECE.2014.6900994"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1504\/IJCSE.2014.058703"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383"},{"key":"ref1","first-page":"60","article-title":"A new heuristic optimization algorithm: Harmony search. Simulation","volume":"76","author":"geem","year":"2001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.170"}],"event":{"name":"2015 5th International Conference on IT Convergence and Security (ICITCS)","start":{"date-parts":[[2015,8,24]]},"location":"Kuala Lumpur, Malaysia","end":{"date-parts":[[2015,8,27]]}},"container-title":["2015 5th International Conference on IT Convergence and Security (ICITCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7287494\/7292885\/07293008.pdf?arnumber=7293008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T21:00:19Z","timestamp":1498251619000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7293008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icitcs.2015.7293008","relation":{},"subject":[],"published":{"date-parts":[[2015,8]]}}}