{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:43:32Z","timestamp":1743018212415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030456900"},{"type":"electronic","value":"9783030456917"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45691-7_53","type":"book-chapter","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T21:03:32Z","timestamp":1591563812000},"page":"564-573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel CPU\/GPU Bees Swarm Optimization Algorithm for the Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Celia","family":"Hireche","sequence":"first","affiliation":[]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Hireche, C., Drias, H.: Density based clustering for satisfiability solving. In: World Conference on Information Systems and Technologies, pp. 899-908. Springer, Heidelberg (2018)","key":"53_CR1","DOI":"10.1007\/978-3-319-77712-2_85"},{"key":"53_CR2","series-title":"A Series of Books in the Mathematical Sciences","first-page":"x+338","volume-title":"Computers and Intractability: A Guide of the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide of the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences, p. x+338. W.H. Freeman and Co., New York (1979). ISBN 0-7167-1045-5. MR 519066"},{"doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: Proceeding 3rd Annual ACM Symposium on the Theory of Computing, New York, pp. 151-198 (1971)","key":"53_CR3","DOI":"10.1145\/800157.805047"},{"doi-asserted-by":"publisher","unstructured":"Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, US (2005). ISBN: 978-1-4020-7263-5. \nhttps:\/\/doi.org\/10.1007\/b101874.","key":"53_CR4","DOI":"10.1007\/b101874."},{"doi-asserted-by":"crossref","unstructured":"Drias, H., Sadeg, S., Yahi, S.: Cooperatives bees swarm for solving the maximum weighted satisfiability problem. In: Proceeding of IWANN 2005, LNCS, vol. 3512, pp. 318-325. Springer, Barcelona (2005)","key":"53_CR5","DOI":"10.1007\/11494669_39"},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF00175101","volume":"28","author":"TD Seeley","year":"1991","unstructured":"Seeley, T.D., Camazine, S., Sneyd, J.: Collective decision-making in honey bees: how colonies choose among nectar sources. Behav. Ecol. Sociobiol. 28, 277\u2013290 (1991)","journal-title":"Behav. Ecol. Sociobiol."},{"unstructured":"NVIDIA CUDA C programming guide version 4.0. Nvidia Corporation (2012)","key":"53_CR7"},{"key":"53_CR8","volume-title":"Programming Massively Parallel Processors: A Hands-on Approach","author":"DB Kirk","year":"2016","unstructured":"Kirk, D.B., Wen-Mei, W.H.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann, Burlington (2016)"},{"unstructured":"Han, J., et al.: Data mining, concepts and techniques. Third Edition (The Morgan Kaufmann Series in Data Management Systems) (2011)","key":"53_CR9"},{"issue":"7","key":"53_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: The Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS99), LNCS. Springer, Heidelberg (1999)","key":"53_CR11","DOI":"10.1007\/3-540-49059-0_14"},{"unstructured":"BMC. \nhttp:\/\/www.satcompetition.org\/2013\/downloads.shtml","key":"53_CR12"},{"unstructured":"Artificially Generated Random. \nhttps:\/\/baldur.iti.kit.edu\/sat-competition-2016\/index.php?cat=benchmarks","key":"53_CR13"},{"unstructured":"Random SAT. \nhttps:\/\/baldur.iti.kit.edu\/sat-competition-2016\/index.php?cat=benchmarks","key":"53_CR14"},{"doi-asserted-by":"crossref","unstructured":"Hireche, C., Drias, H.: Multidimensional appropriate clustering and DBSCAN for SAT solving . Data Technol. Appl. J. (2019). Emerald Publishing Limited","key":"53_CR15","DOI":"10.1108\/DTA-07-2018-0068"}],"container-title":["Advances in Intelligent Systems and Computing","Trends and Innovations in Information Systems and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45691-7_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T21:15:47Z","timestamp":1591564547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45691-7_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030456900","9783030456917"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45691-7_53","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WorldCIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Conference on Information Systems and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"worldcist2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.worldcist.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}