{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:21Z","timestamp":1725564921115},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_75","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:35:03Z","timestamp":1283974503000},"page":"899-903","source":"Crossref","is-referenced-by-count":17,"title":["Boosting as a Metaphor for Algorithm Design"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Leyton-Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"Nudelman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galen","family":"Andrew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"McFadden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoav","family":"Shoham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Sequential Monte Carlo Methods in Practice","year":"2001","key":"75_CR1","unstructured":"Doucet, A., de Freitas, N., Gordon, N. (eds.): Sequential Monte Carlo Methods in Practice. Springer, Heidelberg (2001)"},{"key":"75_CR2","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: IJCAI (1999)"},{"key":"75_CR3","unstructured":"Gonen, R., Lehmann, D.: Linear programming helps solving large multi-unit combinatorial auctions, TR-2001-8, Leibniz Center for Research in Computer Science (April 2001)"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, M.: A Bayesian approach to tackling hard computational problems. In: UAI (2001)","DOI":"10.1016\/S1571-0653(04)00335-X"},{"key":"75_CR5","unstructured":"Lagoudakis, M., Littman, M.: Algorithm selection using reinforcement learning. In: ICML (2000)"},{"key":"75_CR6","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: IJCAI (2003)"},{"key":"75_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"K. Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 556. Springer, Heidelberg (2002)"},{"key":"75_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Advances in Computers\u00a015, 65\u2013118 (1976)","journal-title":"Advances in Computers"},{"key":"75_CR9","first-page":"197","volume":"5","author":"R. Schapire","year":"1990","unstructured":"Schapire, R.: The strength of weak learnability. Machine Learning\u00a05, 197\u2013227 (1990)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T03:29:32Z","timestamp":1559618972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}