{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T08:50:51Z","timestamp":1791017451307,"version":"4.1.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,10,20]],"date-time":"2009-10-20T00:00:00Z","timestamp":1255996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10710-009-9091-4","type":"journal-article","created":{"date-parts":[[2009,10,19]],"date-time":"2009-10-19T06:55:13Z","timestamp":1255935313000},"page":"391-415","source":"Crossref","is-referenced-by-count":43,"title":["Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework"],"prefix":"10.1007","volume":"10","author":[{"given":"Asim","family":"Munawar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Wahib","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masaharu","family":"Munetomo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kiyoshi","family":"Akama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,10,20]]},"reference":[{"key":"9091_CR1","unstructured":"http:\/\/www.nvidia.com\/cuda\/"},{"key":"9091_CR2","unstructured":"http:\/\/www.openmp.org\/"},{"key":"9091_CR3","unstructured":"nVidia CUDA Programming Guide 2.1 - CUDA 2.1 SDK Documentation (2008). http:\/\/www.nvidia.com\/cuda\/"},{"key":"9091_CR4","doi-asserted-by":"crossref","unstructured":"E. Alba, B. Dorronsoro, Cellular Genetic Algorithms, Operations Research\/Computer Science Interfaces Series, vol. 42 (Springer, 2008)","DOI":"10.1007\/978-0-387-77610-1_1"},{"key":"9091_CR5","doi-asserted-by":"crossref","unstructured":"D. Boughaci, H. Drias, Solving weighted max-sat optimization problems using a taboo scatter search metaheuristic. in SAC \u201904: Proceedings of the 2004 ACM Symposium on Applied Computing (ACM, New York, 2004), pp. 35\u201336","DOI":"10.1145\/967900.967910"},{"key":"9091_CR6","unstructured":"D. Boughaci, H. Drias, B. Benhamou, Solving max-sat problems using a memetic evolutionary meta-heuristic, in Cybernetics and Intelligent Systems, 2004 IEEE Conference on Publication, vol. 1. (2004), pp. 480\u2013484"},{"key":"9091_CR7","doi-asserted-by":"crossref","unstructured":"H. Drias, Scatter search with walk strategy for solving hard max-w-sat problems, in Proceedings of IEA- AIE2001m Lecture Notes in Computer Science, LNAI-2070 (Springer, Budapest, 2001), p. 3544","DOI":"10.1007\/3-540-45517-5_5"},{"issue":"2","key":"9091_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/MIS.2007.28","volume":"22","author":"K. Fok","year":"2007","unstructured":"K. Fok, T. Wong, M. Wong, Evolutionary computing on consumer graphics hardware. IEEE Int. Syst. 22(2), 69\u201378 (2007)","journal-title":"IEEE Int. Syst."},{"key":"9091_CR9","doi-asserted-by":"crossref","unstructured":"J. Frank, A study of genetic algorithms to find approximate solutions to hard 3cnf problems, in Golden West International Conference on Artificial Intelligence (Kluwer Academic Publishers, 1994)","DOI":"10.1007\/978-94-011-7108-3_57"},{"key":"9091_CR10","unstructured":"H. Hoos, T. Stutzle, Satlib: An Online Resource for Research on Sat (IOS Press, 2000), pp. 283\u2013292. SATLIB is available online at http:\/\/www.satlib.org"},{"key":"9091_CR11","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C. Gelatt, M. Vecchi, Optimization by simulated annealing. Science, Number 4598, 13 May 1983 220, 4598, 671\u2013680 (1983)","DOI":"10.1126\/science.220.4598.671"},{"key":"9091_CR12","unstructured":"C. Li, Exploiting yet more the power of unit clause propagation to solve 3-sat problem, in ECAI\u201996 Workshop on Advances in Propositional Deduction (Budapest, Hungary, 1996), pp. 11\u201316"},{"key":"9091_CR13","unstructured":"C. Li, Anbulagan: Heuristics based on unit propagation for satisfiability problems, in IJCAI (1), (1997), pp. 366\u2013371"},{"key":"9091_CR14","doi-asserted-by":"crossref","unstructured":"J. Li, X. Wang, R. He, Z. Chi, An efficient fine-grained parallel genetic algorithm based on gpu-accelerated, in NPC \u201907: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (IEEE Computer Society, Washington, DC, 2007), pp. 855\u2013862","DOI":"10.1109\/NPC.2007.108"},{"issue":"2","key":"9091_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MM.2008.31","volume":"28","author":"E. Lindholm","year":"2008","unstructured":"E. Lindholm, J. Nickolls, S. Oberman, J. Montrym, Nvidia tesla: a unified graphics and computing architecture. Micro. IEEE 28(2), 39\u201355 (2008)","journal-title":"Micro. IEEE"},{"issue":"7","key":"9091_CR16","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"D. Martin","year":"1962","unstructured":"D. Martin, L. George, L. Donald, A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"1","key":"9091_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"M. Matsumoto, T. Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9091_CR18","doi-asserted-by":"crossref","unstructured":"M. Matsumoto, T. Nishimura, Dynamic creation of pseudorandom number generators, in Monte Carlo and Quasi-Monte Carlo Methods 1998 (Springer, 2000), pp. 56\u201369","DOI":"10.1007\/978-3-642-59657-5_3"},{"key":"9091_CR19","unstructured":"B. Mazure, L. Sais, E. Crmoire, A tabu search for sat, in Proceedings of AAAI (1997)"},{"key":"9091_CR20","unstructured":"V. Podlozhnyuk, Parallel mersenne twister. CUDA 2.1 SDK Documentation (2007)"},{"key":"9091_CR21","unstructured":"B. Selman, H. Kautz, B. Cohen, Noise strategies for improving local search (1994)"},{"key":"9091_CR22","doi-asserted-by":"crossref","unstructured":"J. Stratton, S. Stone, W. Hwu, Mcuda: an efficient implementation of cuda kernels on multi-cores. Technical Report IMPACT-08-01, University of Illinois at Urbana-Champaign (2008)","DOI":"10.1007\/978-3-540-89740-8_2"},{"key":"9091_CR23","unstructured":"M. Tomassini, Spatially Structured Evolutionary Algorithms (Springer, Berlin, 2005)"},{"key":"9091_CR24","unstructured":"Q. Yu, C. Chen, Z. Pan, Parallel Genetic Algorithms on Programmable Graphics Hardware, vol. 3612 (2005), pp. 1051\u20131059"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-009-9091-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-009-9091-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-009-9091-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:22:05Z","timestamp":1559240525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-009-9091-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,20]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9091"],"URL":"https:\/\/doi.org\/10.1007\/s10710-009-9091-4","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,20]]}}}