{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:23:18Z","timestamp":1773080598886,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540926948","type":"print"},{"value":"9783540926955","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_3","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T05:11:59Z","timestamp":1229404319000},"page":"25-40","source":"Crossref","is-referenced-by-count":6,"title":["Learning While Optimizing an Unknown Fitness Surface"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Battiti","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Brunato","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Campigotto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing\u00a06(2), 126\u2013140 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Battiti, R., Brunato, M.: Reactive search: machine learning for memory-based heuristics. In: Gonzalez, T.F. (ed.) Approximation Algorithms and Metaheuristics, pp. 21\u20131 \u2013 21\u201317. Taylor and Francis Books, CRC Press, Washington (2007)","DOI":"10.1201\/9781420010749.ch21"},{"key":"3_CR3","volume-title":"Operations research\/Computer Science Interfaces","author":"R. Battiti","year":"2008","unstructured":"Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization. In: Operations research\/Computer Science Interfaces. Springer, Heidelberg (in press, 2008)"},{"key":"3_CR4","unstructured":"Battiti, R.: Machine learning methods for parameter tuning in heuristics. In: 5th DIMACS Challenge Workshop: Experimental Methodology Day, Rutgers University (October 1996)"},{"key":"3_CR5","unstructured":"Bertsekas, D., Tsitsiklis, J.: Neuro-Dynamic Programming. Athena Scientific (1996)"},{"issue":"6","key":"3_CR6","first-page":"1107","volume":"4","author":"M. Lagoudakis","year":"2004","unstructured":"Lagoudakis, M., Parr, R.: Least-Squares Policy Iteration. Journal of Machine Learning Research\u00a04(6), 1107\u20131149 (2004)","journal-title":"Journal of Machine Learning Research"},{"key":"3_CR7","first-page":"1","volume":"3","author":"S. Baluja","year":"2000","unstructured":"Baluja, S., Barto, A., Boese, K., Boyan, J., Buntine, W., Carson, T., Caruana, R., Cook, D., Davies, S., Dean, T., et al.: Statistical Machine Learning for Large-Scale Optimization. Neural Computing Surveys\u00a03, 1\u201358 (2000)","journal-title":"Neural Computing Surveys"},{"key":"3_CR8","unstructured":"Boyan, J.A., Moore, A.W.: Learning evaluation functions for global optimization and boolean satisfability. In: Press, A. (ed.) Proc. of 15th National Conf. on Artificial Intelligence (AAAI), pp. 3\u201310 (1998)"},{"key":"3_CR9","unstructured":"Zhang, W., Dietterich, T.: A reinforcement learning approach to job-shop scheduling. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, vol.\u00a01114 (1995)"},{"key":"3_CR10","first-page":"1024","volume":"8","author":"W. Zhang","year":"1996","unstructured":"Zhang, W., Dietterich, T.: High-performance job-shop scheduling with a time-delay TD (\u03bb) network. Advances in Neural Information Processing Systems\u00a08, 1024\u20131030 (1996)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lagoudakis, M., Littman, M.: Learning to select branching rules in the DPLL procedure for satisfiability. In: LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, SAT 2001 (2001)","DOI":"10.1016\/S1571-0653(04)00332-4"},{"key":"3_CR12","unstructured":"Lagoudakis, M., Littman, M.: Algorithm selection using reinforcement learning. In: Proceedings of the Seventeenth International Conference on Machine Learning, pp. 511\u2013518 (2000)"},{"key":"3_CR13","unstructured":"Muller, S., Schraudolph, N., Koumoutsakos, P.: Step size adaptation in evolution strategies using reinforcementlearning. In: Proceedings of the 2002 Congress on Evolutionary Computation, 2002. CEC 2002, vol.\u00a01, pp. 151\u2013156 (2002)"},{"key":"3_CR14","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69868-5_10","volume-title":"Engineering Self-Organising Systems","author":"A. Eiben","year":"2007","unstructured":"Eiben, A., Horvath, M., Kowalczyk, W., Schut, M.: Reinforcement learning for online control of evolutionary algorithms. In: Brueckner, S.A., Hassas, S., Jelasity, M., Yamins, D. (eds.) ESOA 2006. LNCS (LNAI), vol.\u00a04335. Springer, Heidelberg (2007)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-1-4613-0303-9_2","volume-title":"Handbook of Combinatorial Optimization","author":"R. Battiti","year":"1998","unstructured":"Battiti, R., Protasi, M.: Approximate algorithms and heuristics for MAX-SAT. In: Du, D., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol.\u00a01, pp. 77\u2013148. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"3_CR16","unstructured":"Lagoudakis, M., Parr, R.: LSPI: Least-squares policy iteration (as of September 1, 2007), http:\/\/www.cs.duke.edu\/research\/AI\/LSPI\/"},{"key":"3_CR17","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), San Jose, Ca, pp. 459\u2013465 (July 1992)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Steinmann, O., Strohmaier, A., Stutzle, T.: Tabu search vs. random walk. In: KI - Kunstliche Intelligenz, pp. 337\u2013348 (1997)","DOI":"10.1007\/3540634932_27"},{"key":"3_CR19","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), San Jose, Ca, pp. 440\u2013446 (July 1992)"},{"key":"3_CR20","first-page":"321","volume-title":"Proceedings of the national conference on artificial intelligence (14)","author":"D. McAllester","year":"1997","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of the national conference on artificial intelligence (14), pp. 321\u2013326. John Wiley & sons LTD., USA (1997)"},{"key":"3_CR21","volume-title":"Proceedings of the national conference on artificial intelligence","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the national conference on artificial intelligence, vol.\u00a012. John Wiley & sons LTD., USA (1994)"},{"key":"3_CR22","unstructured":"Tompkins, D.A.D., Hoos, H.H.: Novelty\u2009+\u2009 and adaptive novelty\u2009+\u2009. SAT 2004 Competition Booklet (solver description) (2004)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F.H.D. Tompkins","year":"2002","unstructured":"Tompkins, F.H.D., Hoos, H.: Scaling and probabilistic smoothing: Efficient dynamic local search for sat. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 233. Springer, Heidelberg (2002)"},{"key":"3_CR24","first-page":"334","volume-title":"Proceedings of the international joint conference on artificial intelligence","author":"D. Schuurmans","year":"2001","unstructured":"Schuurmans, D., Southey, F., Holte, R.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proceedings of the international joint conference on artificial intelligence, vol.\u00a017, pp. 334\u2013341. Lawrence Erlbaum associates LTD., USA (2001)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics\u00a02 (ARTICLE 2) (1997), http:\/\/www.jea.acm.org\/","DOI":"10.1145\/264216.264220"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T05:21:53Z","timestamp":1557984113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}