{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:12:57Z","timestamp":1726513977734},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220671"},{"type":"electronic","value":"9783540248385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_31","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T21:34:14Z","timestamp":1281303254000},"page":"417-431","source":"Crossref","is-referenced-by-count":14,"title":["A Statistical Approach for Algorithm Selection"],"prefix":"10.1007","author":[{"given":"Joaqu\u00edn","family":"P\u00e9rez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolfo A.","family":"Pazos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Frausto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Cruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Computers and Intractability, a Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"31_CR2","volume-title":"Combinatorial Optimization, Algorithms and Complexity","author":"C. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, New Jersey (1982)"},{"key":"31_CR3","volume-title":"Linear Network Optimization, Algorithms and Codes","author":"Bertsekas","year":"1991","unstructured":"Bertsekas: Linear Network Optimization, Algorithms and Codes. MIT Press, Cambridge (1991)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimizations. IEEE Transactions on Evolutionary Computation\u00a01, 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-39853-0_13","volume-title":"AI*IA 2003: Advances in Artificial Intelligence","author":"J. P\u00e9rez","year":"2003","unstructured":"P\u00e9rez, J., Pazos, R.A., Fraire, H., Cruz, L., Pecero, J.: Adaptive Allocation of Data-Objects in the Web Using Neural Networks. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003. LNCS, vol.\u00a02829, pp. 154\u2013164. Springer, Heidelberg (2003)"},{"key":"31_CR6","unstructured":"Borghetti, B.J.: Inference Algorithm Performance and Selection under Constrained Resources. MS Thesis. AFIT\/GCS\/ENG\/96D-05 (1996)"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S. Minton","year":"1996","unstructured":"Minton, S.: Automatically Configuring Constraint Satisfaction Programs: A Case Study. Journal of Constraints\u00a01(1), 7\u201343 (1996)","journal-title":"Journal of Constraints"},{"key":"31_CR8","unstructured":"Fink, E.: How to Solve it Automatically, Selection among Problem-solving Methods. In: Proceedings of the Fourth International Conference on AI Planning Systems AIPS 1998, pp. 128\u2013136 (1998)"},{"key":"31_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45372-5_13","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"C. Soares","year":"2000","unstructured":"Soares, C., Brazdil, P.: Zoomed Ranking, Selection of Classification Algorithms Based on Relevant Performance Information. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 126\u2013135. Springer, Heidelberg (2000)"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/B978-0-12-395608-8.50035-9","volume-title":"Interactive Systems for Experimental Applied Mathematics","author":"J.R. Rice","year":"1968","unstructured":"Rice, J.R.: On the Construction of Poly-algorithms for Automatic Numerical Analysis. In: Klerer, M., Reinfelds, J. (eds.) Interactive Systems for Experimental Applied Mathematics, pp. 301\u2013313. Academic Press, London (1968)"},{"issue":"5","key":"31_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1096-9128(199705)9:5<345::AID-CPE258>3.0.CO;2-7","volume":"9","author":"J. Li","year":"1997","unstructured":"Li, J., Skjellum, A., Falgout, R.D.: A Poly-Algorithm for Parallel Dense Matrix Multiplication on Two-Dimensional Process Grid Topologies. Concurrency, Practice and Experience\u00a09(5), 345\u2013389 (1997)","journal-title":"Concurrency, Practice and Experience"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Brewer, E.A.: High-Level Optimization Via Automated Statistical Modeling. In: Proceedings of Principles and Practice of Parallel Programming, pp. 80\u201391 (1995)","DOI":"10.1145\/209936.209946"},{"key":"31_CR13","volume-title":"Computer Algortihms, Introduction to Design and Analysis","author":"S. Basse","year":"1998","unstructured":"Basse, S.: Computer Algortihms, Introduction to Design and Analysis. Editorial Addison-Wesley Publishing Company, Reading (1998)"},{"key":"31_CR14","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"E.G. Coffman","year":"1997","unstructured":"Coffman, E.G.: Jr., Garey, M.R., Johnson, D.S.: Approximation Algorithms for Bin-Packing, a Survey. In: Approximation Algorithms for NP-hard Problems, pp. 46\u201393. PWS, Boston (1997)"},{"key":"31_CR15","volume-title":"Handbook of Combinatorial Optimization","author":"J.E.G. Coffman","year":"1998","unstructured":"Coffman, J.E.G., Galambos, G., Martello, S., Vigo, D.: Bin Packing Approximation Algorithms; Combinatorial Analysis. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Boston (1998)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent Advances on Two-dimensional Bin Packing Problems. Discrete Applied Mathematics\u00a0123(1-3), Elsevier Science B.V., Amsterdam (2002)","DOI":"10.1016\/S0166-218X(01)00347-X"},{"key":"31_CR17","unstructured":"Ducatelle, F., Levine, J.: Ant Colony Optimisation for Bin Packing and Cutting Stock Problems. In: Proceedings of the UK Workshop on Computational Intelligence, Edinburgh (2001)"},{"key":"31_CR18","series-title":"Lecture Notes in Artificial Intelligence","first-page":"119","volume-title":"MICAI 2002: Advances in Artificial Intelligence","author":"J. P\u00e9rez","year":"2002","unstructured":"P\u00e9rez, J., Pazos, R.A., V\u00e9lez, L., Rodr\u00edguez, G.: Automatic Generation of Control Parameters for the Threshold Accepting Algorithm. In: Coello Coello, C.A., de Albornoz, \u00c1., Sucar, L.E., Battistutti, O.C. (eds.) MICAI 2002. LNCS (LNAI), vol.\u00a02313, pp. 119\u2013127. Springer, Heidelberg (2002)"},{"key":"31_CR19","unstructured":"Micheals, R.J., Boult, T.E.: A Stratified Methodology for Classifier and Recognizer Evaluation. In: IEEE Workshop on Empirical Evaluation Methods in Computer Vision (2001)"},{"key":"31_CR20","first-page":"942","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"P. Ross","year":"2002","unstructured":"Ross, P., Schulenburg, S., Marin-Bl\u00e1zquez, J.G., Hart, E.: Hyper-heuristics, Learning to Combine Simple Heuristics in Bin-packing Problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 942\u2013948. Morgan Kaufmann, San Francisco (2002)"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:53Z","timestamp":1605761813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}