{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:24:26Z","timestamp":1649129066536},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T00:00:00Z","timestamp":1481932800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10898-016-0482-9","type":"journal-article","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T13:12:57Z","timestamp":1481980377000},"page":"893-907","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Default policies for global optimisation of noisy functions with severe noise"],"prefix":"10.1007","volume":"67","author":[{"given":"Spyridon","family":"Samothrakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Fasli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Perez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,17]]},"reference":[{"issue":"1","key":"482_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"482_CR2","unstructured":"Finck, S., Hansen, N., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2010: noisy functions definitions (2012). http:\/\/coco.lri.fr\/downloads\/download11.06\/bbobdocnoisyfunctions.pdf"},{"key":"482_CR3","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O., et al.: Modification of uct with patterns in monte-carlo go. Tech. rep, INRIA (2006)"},{"key":"482_CR4","doi-asserted-by":"crossref","unstructured":"Glasmachers, T., Schaul, T., Yi, S., Wierstra, D., Schmidhuber, J.: Exponential Natural Evolution Strategies. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 393\u2013400. ACM (2010)","DOI":"10.1145\/1830483.1830557"},{"key":"482_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-32494-1_4","volume-title":"Towards a new evolutionary computation. Advances on estimation of distribution algorithms","author":"N Hansen","year":"2006","unstructured":"Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J., Larranaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a new evolutionary computation. Advances on estimation of distribution algorithms, pp. 75\u2013102. Springer, Berlin (2006)"},{"issue":"1","key":"482_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1198\/0003130042836","volume":"58","author":"DR Hunter","year":"2004","unstructured":"Hunter, D.R., Lange, K.: A tutorial on mm algorithms. Am. Stat. 58(1), 30\u201337 (2004)","journal-title":"Am. Stat."},{"key":"482_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-662-45523-4_29","volume-title":"Applications of Evolutionary Computation","author":"SM Lucas","year":"2014","unstructured":"Lucas, S.M., Samothrakis, S., Perez, D.: Fast evolutionary adaptation for monte carlo tree search. Applications of Evolutionary Computation, pp. 349\u2013360. Springer, Berlin (2014)"},{"key":"482_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/978-3-642-40020-9_2","volume-title":"Geometric Science of Information Lecture, Notes in Computer Science","author":"Y Ollivier","year":"2013","unstructured":"Ollivier, Y.: Information-geometric optimization: the interest of information theory for discrete and continuous optimization. In: Nielsen, F., Barbaresco, F. (eds.) Geometric Science of Information Lecture, Notes in Computer Science, vol. 8085, pp. 4\u20134. Springer, Berlin (2013)"},{"issue":"3","key":"482_CR9","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"L Rios","year":"2013","unstructured":"Rios, L., Sahinidis, N.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013). doi: 10.1007\/s10898-012-9951-y","journal-title":"J. Glob. Optim."},{"key":"482_CR10","doi-asserted-by":"crossref","unstructured":"Schaul, T.: Comparing natural evolution strategies to bipop-cma-es on noiseless and noisy black-box optimization testbeds. In: Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 237\u2013244. ACM (2012)","DOI":"10.1145\/2330784.2330819"},{"issue":"2","key":"482_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10994-012-5280-0","volume":"87","author":"D Silver","year":"2012","unstructured":"Silver, D., Sutton, R.S., M\u00fcller, M.: Temporal-difference search in computer go. Mach. Learn. 87(2), 183\u2013219 (2012)","journal-title":"Mach. Learn."},{"key":"482_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-46033-0_10","volume-title":"Artificial Evolution","author":"I Tendresse la","year":"2002","unstructured":"la Tendresse, I., Gottlieb, J., Kao, O.: The effects of partial restarts in evolutionary search. Artificial Evolution, pp. 117\u2013127. Springer, Berlin (2002)"},{"key":"482_CR13","unstructured":"Valko, M., Carpentier, A., Munos, R.: Stochastic Simultaneous Optimistic Optimization. In: 30th International Conference on Machine Learning. Atlanta, \u00c9tats-Unis (2013). http:\/\/hal.inria.fr\/hal-00789606"},{"issue":"1","key":"482_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evolut. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0482-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0482-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0482-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T17:05:16Z","timestamp":1568653516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0482-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,17]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["482"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0482-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,17]]}}}