{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T09:02:31Z","timestamp":1760346151139},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_17","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"197-211","source":"Crossref","is-referenced-by-count":11,"title":["Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory"],"prefix":"10.1007","author":[{"given":"Vincent A.","family":"Cicirello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"271","volume-title":"Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference","author":"J.L. Bresina","year":"1996","unstructured":"Bresina, J.L.: Heuristic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, vol.\u00a01, pp. 271\u2013278. AAAI Press, Menlo Park (1996)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-46135-3_9","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"V.A. Cicirello","year":"2002","unstructured":"Cicirello, V.A., Smith, S.F.: Amplification of search performance through randomization of heuristics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 124\u2013138. Springer, Heidelberg (2002)"},{"key":"#cr-split#-17_CR3.1","unstructured":"Cicirello, V.A.: Boosting Stochastic Problem Solvers Through Online Self-Analysis of Performance. PhD thesis, The Robotics Institute, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (2003);"},{"key":"#cr-split#-17_CR3.2","unstructured":"Also available as technical report CMU-RI-TR-03-27"},{"key":"17_CR4","first-page":"27","volume-title":"Multi-Robot Systems: From Swarms to Intelligent Automata: Proceedings of the 2003 International Workshop on Multi- Robot Systems","author":"D. Goldberg","year":"2003","unstructured":"Goldberg, D., Cicirello, V., Dias, M.B., Simmons, R., Smith, S., Stentz, A.: Market-based multi-robot planning in a distributed layered architecture. In: Multi-Robot Systems: From Swarms to Intelligent Automata: Proceedings of the 2003 International Workshop on Multi- Robot Systems, Washington, DC, vol.\u00a02, pp. 27\u201338. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Allen, J.A., Minton, S.: Selecting the right heuristic algorithm: Runtime performance predictors. In: Proceedings of the Canadian AI Conference (1996)","DOI":"10.1007\/3-540-61291-2_40"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46004-7_1","volume-title":"Applications of Evolutionary Computing","author":"P. Cowling","year":"2002","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol.\u00a02279, pp. 1\u201310. Springer, Heidelberg (2002)"},{"key":"17_CR7","volume-title":"Metaheuristics: Computer Decision Making","author":"A. Nareyek","year":"2003","unstructured":"Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Resende, M.G.C., de Sousa, J.P. (eds.) Metaheuristics: Computer Decision Making, Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126, 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1009669824615","volume":"4","author":"S. Talukdar","year":"1998","unstructured":"Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous teams: Cooperation schemes for autonomous agents. Journal of Heuristics\u00a04, 295\u2013321 (1998)","journal-title":"Journal of Heuristics"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.P. Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"key":"17_CR11","first-page":"1583","volume-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","author":"J. Bresina","year":"1995","unstructured":"Bresina, J., Drummond, M., Swanson, K.: Expected solution quality. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 1583\u20131590. Morgan Kaufmann, San Francisco (1995)"},{"key":"17_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3675-0","volume-title":"An Introduction to Statistical Modeling of Extreme Values","author":"S. Coles","year":"2001","unstructured":"Coles, S.: An Introduction to Statistical Modeling of Extreme Values. Springer, Heidelberg (2001)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.2307\/2347483","volume":"34","author":"J.R.M. Hosking","year":"1985","unstructured":"Hosking, J.R.M.: Algorithm AS 215: Maximum-likelihood estimation of the paramaters of the generalized extreme-value distribution. Applied Statistics\u00a034, 301\u2013310 (1985)","journal-title":"Applied Statistics"},{"key":"17_CR14","series-title":"Monographs on Statistics and Applied Probability","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3324-9","volume-title":"Density Estimation for Statistics and Data Analysis","author":"B.W. Silverman","year":"1986","unstructured":"Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Monographs on Statistics and Applied Probability. Chapman and Hall, Boca Raton (1986)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1137\/1114019","volume":"14","author":"V.A. Epanechnikov","year":"1969","unstructured":"Epanechnikov, V.A.: Non-parametric estimation of a multivariate probability density. Theory of Probability and Its Applications\u00a014, 153\u2013158 (1969)","journal-title":"Theory of Probability and Its Applications"},{"key":"17_CR16","unstructured":"NIST\/SEMATECH: e-Handbook of Statistical Methods. NIST\/SEMATECH (2003), \n                    \n                      http:\/\/www.itl.nist.gov\/div898\/handbook\/"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"L.P. Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: A survey. Journal of Artificial Intelligence Research\u00a04, 237\u2013285 (1996)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf, U., Pesch, E., Phan-Huy, T.: A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Science\u00a046, 1365\u20131384 (2000)","journal-title":"Management Science"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/PL00013356","volume":"23","author":"B. Franck","year":"2001","unstructured":"Franck, B., Neumann, K., Schwindt, C.: Truncated branch-and-bound, scheduleconstruction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum\u00a023, 297\u2013324 (2001)","journal-title":"OR Spektrum"},{"key":"17_CR21","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22341-3","volume-title":"Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions","author":"K. Neumann","year":"2002","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions. Lecture Notes in Economics and Mathematical Systems. Springer, Heidelberg (2002)"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. Journal of Heuristics\u00a08, 109\u2013136 (2002)","journal-title":"Journal of Heuristics"},{"key":"17_CR23","unstructured":"Franck, B., Neumann, K.: Resource-constrained project scheduling with time windows: Structural questions and priority-rule methods. Technical Report WIOR-492, Universit\u00e4t Karlsruhe, Karlsruhe, Germany (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:18Z","timestamp":1620014058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}