{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:28:43Z","timestamp":1748856523949,"version":"3.28.0"},"reference-count":43,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/iske.2017.8258797","type":"proceedings-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T22:47:01Z","timestamp":1516056421000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["An improved genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy"],"prefix":"10.1109","author":[{"given":"Huimin","family":"Fu","sequence":"first","affiliation":[]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guanfeng","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xinran","family":"Ning","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00137-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.aca.2006.02.055"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592273"},{"key":"ref32","first-page":"124","article-title":"Using genetic algorithms to solve NP- complete problems","author":"de jong","year":"1989","journal-title":"Proceedings of the 3rd International Conference on Genetic Algorithms"},{"journal-title":"Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problems","year":"2014","author":"gamarnik","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0494-z"},{"key":"ref37","first-page":"41","article-title":"A solution of the satisfiability problem based on the improved genetic algorithm","volume":"33","author":"zhang","year":"2015","journal-title":"Journal of Qinghai University (Atural Science Edition)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2015.7377998"},{"key":"ref35","first-page":"16","article-title":"Genetic Algorithm to solve the satisfiability Problem","author":"cao","year":"2008","journal-title":"Modern Computer Professional"},{"key":"ref34","article-title":"Genetic Algorithm for Solving SAT problems Based on Learning Clause Weights","volume":"28","author":"ling","year":"2005","journal-title":"Chinese Jouranl of Computers"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu135"},{"key":"ref40","first-page":"1","author":"boughaci","year":"2008","journal-title":"Combining a Unit Propagation with Genetic Algorithms to Solve max-SAT Problems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0556-7"},{"key":"ref12","first-page":"570","article-title":"Improving local search for random 3-SAT using quantitative configuration checking","author":"luo","year":"2012","journal-title":"Proceedings of the 20th European Conference on Artificial Intelligence"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39071-5_22"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2016.7603220"},{"key":"ref15","first-page":"1476","article-title":"Genetic algorithm for solving SAT problems based on learning clause weight","volume":"28","author":"ling","year":"2005","journal-title":"Chinese Journal of Computers"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITNEC.2016.7560401"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INES.2015.7329708"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_4"},{"key":"ref19","first-page":"72","article-title":"Improved Greedy Algorithm for Solving DVRP Problem in Mobile E-commerce","author":"li","year":"2017","journal-title":"Value Engineering"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0122"},{"key":"ref4","first-page":"1","article-title":"Translating pseudo-boolean constraints into SAT","volume":"2","author":"e\u00e9n","year":"2006","journal-title":"J Satisfiability"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ECCE.2016.7854802"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","article-title":"PicoSAT essentials","volume":"4","author":"biere","year":"2008","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"ref6","first-page":"2011","article-title":"A multi-agent social evolutionary algorithm for SAT problems","volume":"37","author":"pan","year":"2014","journal-title":"Chinese Journal of Computers"},{"key":"ref29","first-page":"8","article-title":"Research Advance of SAT Solving Algorithm","volume":"43","author":"guo","year":"2016","journal-title":"Computer Science"},{"key":"ref5","article-title":"Lingeling, Plingeling and Treengeling entering the SAT","author":"biere","year":"2013","journal-title":"Proceedings of SAT Competition 2013"},{"key":"ref8","first-page":"337","article-title":"Noise strategies for improving local search","volume":"94","author":"selman","year":"1994","journal-title":"AAAI"},{"key":"ref7","first-page":"46","volume":"93","author":"selman","year":"1993","journal-title":"An empirical study of greedy local search for satisfiability testing"},{"key":"ref2","first-page":"92","article-title":"An efficient local search algorithm for structured SAT problems","author":"liang","year":"1998","journal-title":"Chinese Journal of Computers"},{"journal-title":"An efficient implementation for walksat","year":"2015","author":"liu","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.07.002"},{"key":"ref22","article-title":"Optimal Greedy Algorithm for Many-Core Scheduling","author":"pathania","year":"2016","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"ref21","first-page":"342","article-title":"On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm","author":"salim","year":"2017","journal-title":"6th International Conference on Systems and Control (ICSC)"},{"year":"0","key":"ref42"},{"key":"ref24","first-page":"169","article-title":"Adaptive genetic algorithm based on a new entropy measurement","volume":"1","author":"ma","year":"2014","journal-title":"Machine Learning and Cybernetics (ICMLC) 2014 International Conference on"},{"key":"ref41","first-page":"90","article-title":"Improved Genetic algorithm for Traveling Salesman Problem","author":"wen","year":"2016","journal-title":"Computer Science"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CADSM.2017.7916145"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3055004.3055012"},{"key":"ref43","first-page":"1422","article-title":"An organizational evolutionary algorithm for SAT problems","volume":"27","author":"liu","year":"2004","journal-title":"Chinese Journal of Computers"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2991\/icetms.2013.398"}],"event":{"name":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","start":{"date-parts":[[2017,11,24]]},"location":"Nanjing","end":{"date-parts":[[2017,11,26]]}},"container-title":["2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8246022\/8258711\/08258797.pdf?arnumber=8258797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,25]],"date-time":"2020-10-25T17:05:29Z","timestamp":1603645529000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8258797\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/iske.2017.8258797","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}