{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:50:16Z","timestamp":1729648216870,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/icnc.2015.7377998","type":"proceedings-article","created":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T21:43:40Z","timestamp":1452548620000},"page":"245-249","source":"Crossref","is-referenced-by-count":3,"title":["The experimental analysis of the efficiency of genetic algorithm based on 3-satisfiability problem"],"prefix":"10.1109","author":[{"given":"Yu-an","family":"Zhang","sequence":"first","affiliation":[]},{"family":"Bingfen Li","sequence":"additional","affiliation":[]},{"family":"Qiao Meng","sequence":"additional","affiliation":[]},{"family":"Qiongqiong Hu","sequence":"additional","affiliation":[]},{"family":"Qinglian Ma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1090\/dimacs\/022\/06","article-title":"Parallel Algorithms for Satisfiability(SAT) Problem","volume":"22","author":"gu","year":"1995","journal-title":"DIMACS volume Series in Discrete Mathematics and Theoretical Computer Science American Mathematical Society"},{"key":"ref11","first-page":"1","article-title":"The local search algorithm of 3-SAT problem","author":"chang","year":"2008","journal-title":"Shangdong Shangdong University"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.11.002"},{"key":"ref13","first-page":"354","article-title":"Study of computational performance of Genetic Algorithm for 3-satisfiability problem","volume":"1","author":"ma","year":"2011","journal-title":"Proceedings of the 16th International Symposium on Artificial Life and Robotics OA15"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(95)80037-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00137-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.aca.2006.02.055"},{"key":"ref17","first-page":"110","article-title":"The decision of genetic algorithm based on 3-SAT problem","volume":"8","author":"wang","year":"2009","journal-title":"Ningxia NingXia Engineering Technology"},{"key":"ref18","first-page":"90","article-title":"A solution if genetic algorithm based on 3-SAT problem","volume":"4","author":"huang","year":"2005","journal-title":"Modern Computer Guangzhou"},{"year":"0","key":"ref19"},{"key":"ref4","first-page":"989","article-title":"Theory of the Simple Genetic Algorithm with a-Selection, Uniform Crossover and Bitwise Mutation","volume":"9","author":"andre","year":"2010","journal-title":"WSEAS Transactions on Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"ref6","first-page":"49","article-title":"Using genetic algorithm to solve 3-sat problem","volume":"7","author":"wu","year":"2005","journal-title":"Fijian Fijian Computer"},{"key":"ref5","first-page":"88","article-title":"The solution about the coding design and evaluation function of 3-SAT problem","volume":"1","author":"tan","year":"2007","journal-title":"Journal of Guangzhou University"},{"key":"ref8","first-page":"1","article-title":"The analysis of research status to improve genetic algorithms","volume":"7","author":"thu","year":"2010","journal-title":"Jilin Jilin Water Conservancy"},{"key":"ref7","first-page":"1","article-title":"3-SAT Problem A New Memetic-PSO Algorithm","volume":"11","author":"lotfi","year":"2013","journal-title":"International Journal of Information and Computer Security"},{"key":"ref2","first-page":"215","article-title":"The Development and research of genetic algorithms","volume":"23","author":"chen","year":"1994","journal-title":"Information and Control-shenyang"},{"article-title":"Adaptation Adaptation in Natural and Artificial Systems","year":"1975","author":"holland","key":"ref1"},{"key":"ref9","first-page":"1","article-title":"The study about the local search algorithm based on Max NAE-SAT and Max-SAT problem","author":"xian","year":"2012","journal-title":"Shanghai Shanghai University"}],"event":{"name":"The 2015 11th International Conference on Natural Computation","start":{"date-parts":[[2015,8,15]]},"location":"Zhangjiajie, China","end":{"date-parts":[[2015,8,17]]}},"container-title":["2015 11th International Conference on Natural Computation (ICNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7368256\/7377953\/07377998.pdf?arnumber=7377998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T12:12:31Z","timestamp":1567512751000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7377998\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/icnc.2015.7377998","relation":{},"subject":[],"published":{"date-parts":[[2015,8]]}}}