{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T19:15:10Z","timestamp":1723058110137},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"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 Comput. Intell. Mag."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/mci.2017.2670460","type":"journal-article","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T18:27:22Z","timestamp":1492021642000},"page":"24-33","source":"Crossref","is-referenced-by-count":10,"title":["Multi-Level Random Walk for Software Test Suite Reduction"],"prefix":"10.1109","volume":"12","author":[{"given":"Zongzheng","family":"Chi","sequence":"first","affiliation":[]},{"given":"Jifeng","family":"Xuan","sequence":"additional","affiliation":[]},{"given":"Zhilei","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Xiaoyuan","family":"Xie","sequence":"additional","affiliation":[]},{"given":"He","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.11.706"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2346"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2560811"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2007.06.003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.05.038"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2002.1167767"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2016.04.016"},{"key":"ref35","first-page":"95","article-title":"A test-suite reduction approach to improving fault-localization effectiveness","volume":"39","author":"gong","year":"2013","journal-title":"Comput Lang Syst Struct"},{"key":"ref34","author":"berkelaar","year":"2004","journal-title":"lp_solve 5 5 2 0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227144"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108802"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2011.26"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635921"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00050-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.028"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.5.862.373"},{"key":"ref17","first-page":"254","article-title":"Backbones in optimization and approximation","author":"slaney","year":"0","journal-title":"Proc 17th Int Joint Conf Artificial Intelligence"},{"key":"ref18","first-page":"1368","article-title":"Backbones and backdoors in satisfiability","author":"kilby","year":"0","journal-title":"Proceedings of the National Conf on Artificial Intelligence"},{"key":"ref19","first-page":"1179","article-title":"Backbone guided local search for maximum satisfiability","author":"zhang","year":"0","journal-title":"Proc 18th Int Joint Conf Artificial Intelligence"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2379776.2379787"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/stv.430"},{"key":"ref6","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"karp","year":"0","journal-title":"Complexity of Computer Computations The IBM Research Symposia Series"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/152388.152391"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019225027893"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2004.1317433"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070541"},{"key":"ref2","year":"2015","journal-title":"Apache Hadoop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2610416"},{"key":"ref1","first-page":"211","article-title":"Practical regression test selection with dynamic file dependencies","author":"gligoric","year":"0","journal-title":"Proc Int Symp Software Testing and Analysis"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2003.1235437"},{"key":"ref20","first-page":"175","article-title":"The backbone of the travelling salesperson","author":"kilby","year":"0","journal-title":"Proc 19th Int Joint Conf Artificial Intelligence"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22183-0_14"},{"key":"ref22","first-page":"248","article-title":"A backbone-search heuristic for efficient solving of hard 3-SAT formulae","author":"dubois","year":"0","journal-title":"Proc 17th Int Joint Conf Artificial Intelligence"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.45"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786878"},{"key":"ref24","first-page":"655","article-title":"An adaptive noise mechanism for Walksat","author":"hoos","year":"0","journal-title":"Proc 18th National Conf Artificial Intelligence and 14th Conf Innovative Applications of Artificial Intelligence"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1547"},{"key":"ref23","first-page":"707","article-title":"Searching for backbones and fat: A limit-crossing approach with applications","author":"climer","year":"0","journal-title":"Proc 18th National Conf Artificial Intelligence and 14th Conf Innovative Applications of Artificial Intelligence"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.92"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/12090191X"},{"key":"ref43","first-page":"389","article-title":"On constrained Boolean Pareto optimization","author":"qian","year":"0","journal-title":"Proc Int Joint Artif Intell Conf"},{"key":"ref25","article-title":"Improving walksat for random k-satisfiability problem with k > 3","author":"cai","year":"0","journal-title":"Proc 27th AAAI Conf Artificial Intelligence"}],"container-title":["IEEE Computational Intelligence Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10207\/7895275\/07895279.pdf?arnumber=7895279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:14:16Z","timestamp":1642004056000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7895279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":46,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/mci.2017.2670460","relation":{},"ISSN":["1556-603X"],"issn-type":[{"value":"1556-603X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5]]}}}