{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:05:11Z","timestamp":1746158711790,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332050"},{"type":"electronic","value":"9783642332067"}],"license":[{"start":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T00:00:00Z","timestamp":1384214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T00:00:00Z","timestamp":1384214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-33206-7_7","type":"book-chapter","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T11:06:44Z","timestamp":1387451204000},"page":"129-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Bayesian Search Game"],"prefix":"10.1007","author":[{"given":"Marc","family":"Toussaint","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,12]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00453-008-9244-5","volume":"57","author":"A. Auger","year":"2010","unstructured":"A. Auger, O. Teytaud, Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica 57(1), 121\u2013146 (2010)","journal-title":"Algorithmica"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1011255519438","volume":"19","author":"H. Gutmann","year":"2001","unstructured":"H. Gutmann, A radial basis function method for global optimization. J. Glob. Optim. 19, 201\u2013227 (2001)","journal-title":"J. Glob. Optim."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N. Hansen","year":"2001","unstructured":"N. Hansen, A. Ostermeier, Completely derandomized self-adaption in evolutionary strategies. Evol. Comput. 9, 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"M. Hutter, Towards a universal theory of artificial intelligence based on algorithmic probability and sequential decision theory. arXiv: cs.AI\/0012011 (2000)","key":"7_CR4","DOI":"10.1007\/3-540-44795-4_20"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/B:JMMA.0000049381.24625.f7","volume":"3","author":"C. Igel","year":"2004","unstructured":"C. Igel, M. Toussaint, A no-free-lunch theorem for non-uniform distributions of target functions. J. Math. Model. Algorithms 3, 313\u2013322 (2004)","journal-title":"J. Math. Model. Algorithms"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"D. Jones","year":"1998","unstructured":"D. Jones, M. Schonlau, W. Welch, Efficient global optimization of expensive black-box functions. J. Glob. Optim. 13, 455\u2013492 (1998)","journal-title":"J. Glob. Optim."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1012771025575","volume":"21","author":"D.R. Jones","year":"2001","unstructured":"D.R. Jones, A taxonomy of global optimization methods based on response surfaces. J. Glob. Optim. 21, 345\u2013383 (2001)","journal-title":"J. Glob. Optim."},{"unstructured":"M. Pelikan, D.E. Goldberg, F. Lobo, A survey of optimization by building and using probabilistic models. Technical Report IlliGAL-99018, Illinois Genetic Algorithms Laboratory, 1999","key":"7_CR8"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1613\/jair.2078","volume":"27","author":"J. Pineau","year":"2006","unstructured":"J. Pineau, G. Gordon, S. Thrun, Anytime point-based approximations for large POMDPs. J. Artif. Intell. Res. 27, 335\u2013380 (2006)","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"J. Poland, Explicit local models: towards optimal optimization algorithms. Technical Report No. IDSIA-09-04, 2004","key":"7_CR10","DOI":"10.1007\/978-3-540-30115-8_54"},{"unstructured":"P. Poupart, C. Boutilier, Bounded finite state controllers, in Advances in Neural Information Processing Systems 16 (NIPS 2003), Vancouver, vol. 16 (MIT Press, 2004)","key":"7_CR11"},{"doi-asserted-by":"crossref","unstructured":"P. Poupart, N. Vlassis, J. Hoey, K. Regan, An analytic solution to discrete Bayesian reinforcement learning, in Proceeding of the 23rd International Conference on Machine Learning (ICML 2006), Pittsburgh, 2006, pp. 697\u2013704","key":"7_CR12","DOI":"10.1145\/1143844.1143932"},{"key":"7_CR13","volume-title":"Gaussian Processes for Machine Learning","author":"C.E. Rasmussen","year":"2006","unstructured":"C.E. Rasmussen, C. Williams, Gaussian Processes for Machine Learning (MIT Press, Cambridge, 2006)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2006.04.005","volume":"361","author":"M. Toussaint","year":"2006","unstructured":"M. Toussaint, Compact representations as a search strategy: compression EDAs. Theor. Comput. Sci. 361, 57\u201371 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR15","volume-title":"Optimization by Gaussian processes assisted evolution strategies, in International Conference on Operations Research (OR 2003)","author":"H. Ulmer","year":"2003","unstructured":"H. Ulmer, F. Streichert, A. Zell, Optimization by Gaussian processes assisted evolution strategies, in International Conference on Operations Research (OR 2003) (Springer, Heidelberg, 2003) pp. 435\u2013442"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Natural Computing Series","Theory and Principled Methods for the Design of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33206-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T07:54:19Z","timestamp":1746086059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-33206-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,12]]},"ISBN":["9783642332050","9783642332067"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33206-7_7","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2013,11,12]]},"assertion":[{"value":"12 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}