{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:48:08Z","timestamp":1729640888849,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/hpcsim.2009.5194889","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T19:09:58Z","timestamp":1250017798000},"page":"153-160","source":"Crossref","is-referenced-by-count":0,"title":["Combining SAT solvers on discrete resources"],"prefix":"10.1109","author":[{"given":"Yanik","family":"Ngoko","sequence":"first","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","article-title":"satzilla: portfolio-based algorithm selection for sat","author":"xu","year":"2008","journal-title":"Journal of Artificial Intelligence Research"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.2469\/faj.v55.n4.2281"},{"key":"11","first-page":"899","article-title":"boosting as a metaphor for algorithm design","author":"leyton-brown","year":"2003","journal-title":"Proceeding of International Conference on Principles and Practice of Constraint Programming"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00332-4"},{"key":"3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10472-007-9050-9","article-title":"learning static parallel portfolios of algorithms","author":"petrik","year":"2006","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","article-title":"an economics approach to hard computational problems","volume":"275","author":"huberman","year":"1997","journal-title":"Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9036-z"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_19"},{"journal-title":"Approximation Algorithms for Np-Hards Problems","year":"1997","key":"6"},{"journal-title":"Online Computation and Competitive Analysis","year":"2005","author":"borodin","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5160879"},{"key":"9","article-title":"satex: a webbased framework for sat experimentation","author":"simon","year":"2001","journal-title":"Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT2001)"},{"key":"8","first-page":"1197","article-title":"combining multiple heuristics online","author":"streeter","year":"2007","journal-title":"Proceedings of the 22rd Conference on Artificial Intelligence"}],"event":{"name":"Simulation (HPCS)","start":{"date-parts":[[2009,6,21]]},"location":"Leipzig, Germany","end":{"date-parts":[[2009,6,24]]}},"container-title":["2009 International Conference on High Performance Computing & Simulation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5173446\/5191573\/05194889.pdf?arnumber=5194889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T20:41:50Z","timestamp":1710535310000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5194889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hpcsim.2009.5194889","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}