{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:25Z","timestamp":1761621025355},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2010,8,1]],"date-time":"2010-08-01T00:00:00Z","timestamp":1280620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/tevc.2009.2033579","type":"journal-article","created":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T20:09:22Z","timestamp":1260994162000},"page":"518-529","source":"Crossref","is-referenced-by-count":18,"title":["Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations"],"prefix":"10.1109","volume":"14","author":[{"given":"M","family":"Qasem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Pr\u00fcgel-Bennett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TEVC.2005.846818","article-title":"Large barrier trees for studying search","volume":"9","author":"hallam","year":"2005","journal-title":"IEEE Trans Evol Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01315244"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/48014.63140"},{"key":"ref10","first-page":"153","article-title":"phase transitions and backbones of 3-sat and maximum 3-sat","volume":"lncs 2239","author":"zhang","year":"2001","journal-title":"Proc 7th Int Conf Principles Practice Constraint Programming (CP)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.819419"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/22055"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"56126","DOI":"10.1103\/PhysRevE.66.056126","article-title":"the random k-satisfiability problem: from an analytic solution to an efficient algorithm","volume":"66","author":"mezard","year":"2002","journal-title":"Phys Rev E"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/nature03602"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/37\/6\/008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.036107"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.197205"},{"key":"ref18","first-page":"440","article-title":"a new method for solving hard satisfiability problems","author":"selman","year":"1992","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref19","first-page":"337","article-title":"noise strategies for improving local search","volume":"1","author":"selman","year":"1994","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/24\/20\/022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04448-3_9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1051\/jphys:0198900500200305700"},{"key":"ref3","first-page":"437","article-title":"The dynamics of a genetic algorithm on a model hard optimization problem","volume":"11","author":"rogers","year":"2000","journal-title":"Complex Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277224"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01313839"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860734-7\/50087-1"},{"key":"ref8","first-page":"459","article-title":"hard and easy distributions of sat problems","author":"mitchell","year":"1992","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277210"},{"key":"ref2","first-page":"184","article-title":"on the analysis of evolutionary algorithms: a proof that crossover can really help","author":"jansen","year":"1999","journal-title":"Proc 7th Annu Eur Symp Algorithms (ESA 99)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00046-1"},{"key":"ref1","first-page":"101","author":"shapiro","year":"1997","journal-title":"Foundations of Genetic Algorithms 4"},{"key":"ref20","author":"tompkins","year":"2008","journal-title":"UBCSAT The Satisfiability Library"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389219"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.001"},{"key":"ref23","author":"syswerda","year":"1993","journal-title":"Foundations of Genetic Algorithms 2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/21\/1\/031"},{"key":"ref25","author":"qasem","year":"2009","journal-title":"WinSAT"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/5532081\/05353655.pdf?arnumber=5353655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:00:12Z","timestamp":1633914012000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5353655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":32,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2009.2033579","relation":{},"ISSN":["1941-0026","1089-778X"],"issn-type":[{"value":"1941-0026","type":"electronic"},{"value":"1089-778X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,8]]}}}