{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:47:18Z","timestamp":1743104838452,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662490136"},{"type":"electronic","value":"9783662490143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-49014-3_58","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T09:41:36Z","timestamp":1450863696000},"page":"653-663","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Hybrid Genetic Algorithm for Maximum Clique Problem on OpenCL"],"prefix":"10.1007","author":[{"given":"Li","family":"Li","sequence":"first","affiliation":[]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Siman","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Juanjuan","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"58_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"I Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"5","key":"58_CR2","doi-asserted-by":"publisher","first-page":"463","DOI":"10.2174\/1574893609666140901222327","volume":"9","author":"X Wang","year":"2014","unstructured":"Wang, X., Miao, Y.: GAEM: a hybrid algorithm incorporating GA with EM for planted edited motif finding problem. Curr. Bioinform. 9(5), 463\u2013469 (2014)","journal-title":"Curr. Bioinform."},{"key":"58_CR3","first-page":"197","volume":"3","author":"PRJ Ostergard","year":"2002","unstructured":"Ostergard, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. Sixth Twente Workshop Graphs Comb. Optim. 3, 197\u2013207 (2002)","journal-title":"Discrete Appl. Math. Sixth Twente Workshop Graphs Comb. Optim."},{"issue":"4","key":"58_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TNB.2015.2402311","volume":"14","author":"T Song","year":"2015","unstructured":"Song, T., Pan, L.: Spiking neural P systems with rules on synapses working in maximum spiking strategy. IEEE Trans. NanoBiosci. 14(4), 465\u2013477 (2015)","journal-title":"IEEE Trans. NanoBiosci."},{"issue":"3","key":"58_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/TNB.2013.2271278","volume":"12","author":"T Song","year":"2013","unstructured":"Song, T., Pan, L., Jiang, K., et al.: Normal forms for some classes of sequential spiking neural P systems. IEEE Trans. NanoBiosci. 12(3), 255\u2013264 (2013)","journal-title":"IEEE Trans. NanoBiosci."},{"key":"58_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1090\/dimacs\/026\/24","volume-title":"Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge","author":"M Resende","year":"1996","unstructured":"Resende, M., Feo, T.: A GRASP for satisfiability. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, vol. 26, pp. 499\u2013520. American Mathematical Society, Providence (1996)"},{"issue":"4","key":"58_CR7","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1089\/cmb.2013.0054","volume":"21","author":"X Wang","year":"2014","unstructured":"Wang, X., Miao, Y., Cheng, M.: Finding motifs in DNA sequences using low-dispersion sequences. J. Comput. Biol. 21(4), 320\u2013329 (2014)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"58_CR8","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.cor.2009.02.013","volume":"37","author":"R Battiti","year":"2010","unstructured":"Battiti, R., Mascia, F.: Reactive and dynamic local search for max-clique: engineering effective building blocks. Comput. Oper. Res. 37(3), 534\u2013542 (2010)","journal-title":"Comput. Oper. Res."},{"key":"58_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ins.2012.07.023","volume":"219","author":"T Song","year":"2013","unstructured":"Song, T., Pan, L., P\u0103un, G.: Asynchronous spiking neural P systems with local synchronization. Inf. Sci. 219, 197\u2013207 (2013)","journal-title":"Inf. Sci."},{"key":"58_CR10","unstructured":"Bui, T.N., Eppley, P.H.: A hybrid genetic algorithm for the maximum clique problem. In: Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, pp. 478\u2013484 (1995)"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Marchiori, E.: A simple heuristic based genetic algorithm for the maximum clique problem. In: Proceedings of the ACM Symposium on Applied Computing, pp. 366\u2013373 (1998)","DOI":"10.1145\/330560.330841"},{"issue":"1","key":"58_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TNB.2014.2367506","volume":"14","author":"T Song","year":"2015","unstructured":"Song, T., Pan, L.: Spiking neural P systems with rules on synapses working in maximum spikes consumption strategy. IEEE Trans. NanoBiosci. 14(1), 38\u201344 (2015)","journal-title":"IEEE Trans. NanoBiosci."},{"key":"58_CR13","doi-asserted-by":"publisher","unstructured":"Zhang, X., Pan, L., Paun, A.: On the universality of axon P systems. IEEE Trans. Neural Netw. Learn. Syst. (2015). doi:\n                  10.1109\/TNNLS.2015.2396940","DOI":"10.1109\/TNNLS.2015.2396940"},{"key":"58_CR14","doi-asserted-by":"publisher","unstructured":"Zhang, X., Tian, Y., Jin, Y.: A knee point driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. (2014). doi:\n                  10.1109\/TEVC.2014.2378512","DOI":"10.1109\/TEVC.2014.2378512"},{"issue":"2","key":"58_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Cheng, R., Jin, Y.: An efficient approach to non-dominated sorting for evolutionary multi-objective optimization. IEEE Trans. Evol. Comput. 19(2), 201\u2013213 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"58_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.parco.2011.10.002","volume":"38","author":"P Du","year":"2011","unstructured":"Du, P., Weber, R., Luszczek, P.: From CUDA to OpenCL: towards a performance-portable solution for multi-platform GPU programming. Parallel Comput. 38(8), 391\u2013407 (2011)","journal-title":"Parallel Comput."},{"issue":"4","key":"58_CR17","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TNB.2012.2208122","volume":"11","author":"T Song","year":"2012","unstructured":"Song, T., Pan, L., Wang, J., et al.: Normal forms of spiking neural P systems with anti-spikes. IEEE Trans. NanoBiosci. 11(4), 352\u2013359 (2012)","journal-title":"IEEE Trans. NanoBiosci."},{"issue":"10","key":"58_CR18","doi-asserted-by":"publisher","first-page":"9955","DOI":"10.1364\/OE.18.009955","volume":"18","author":"T Shimobaba","year":"2010","unstructured":"Shimobaba, T., Ito, T., Masuda, N.: Fast calculation of computer-generated-hologram on AMD HD5000 series GPU and OpenCL. Opt. Express 18(10), 9955\u20139960 (2010)","journal-title":"Opt. Express"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing -- Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49014-3_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T22:57:26Z","timestamp":1559343446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49014-3_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662490136","9783662490143"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49014-3_58","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}