{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:22:59Z","timestamp":1649125379535},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,6,12]],"date-time":"2013-06-12T00:00:00Z","timestamp":1370995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10732-013-9226-x","type":"journal-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T10:59:10Z","timestamp":1370948350000},"page":"819-844","source":"Crossref","is-referenced-by-count":3,"title":["Using automatic programming to generate state-of-the-art algorithms for random 3-SAT"],"prefix":"10.1007","volume":"19","author":[{"given":"Roland","family":"Olsson","sequence":"first","affiliation":[]},{"given":"Arne","family":"L\u00f8kketangen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,12]]},"reference":[{"key":"9226_CR1","unstructured":"Bartz-Beielstein, T., Lasarczyk, C.W.G., Preuss, M.: Sequential parameter optimization. In: IEEE Congress on Evolutionary Computation, pp. 773\u2013780 (2005)"},{"issue":"10","key":"9226_CR2","doi-asserted-by":"crossref","first-page":"1980","DOI":"10.1016\/j.neucom.2007.10.018","volume":"71","author":"H Berg","year":"2008","unstructured":"Berg, H., Olsson, R., Lindblad, T., Chilo, J.: Automatic design of pulse coupled neurons for image segmentation. Neurocompuing 71(10), 1980\u20131993 (2008)","journal-title":"Neurocompuing"},{"key":"9226_CR3","doi-asserted-by":"crossref","unstructured":"Berg, H., Olsson, R., Rus\u00e5s, P., Jakobsen, M.: Automated synthesis of control algorithms from first principles. In: The 2009 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2009). IEEE Press, St. Louis (2009)","DOI":"10.1109\/IROS.2009.5354551"},{"key":"9226_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"9226_CR5","unstructured":"Du, D., Gu, J., Pardalos, P.: Satisfiability problem: theory and applications DIMACS series. In: Discrete Mathematics and Theoretical Computer Science, vol. 35 (1997)"},{"issue":"1","key":"9226_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1162\/evco.2008.16.1.31","volume":"16","author":"AS Fukunaga","year":"2008","unstructured":"Fukunaga, A.S.: Automated discovery of local search heuristics for satisfiability testing. Evol. Comput. 16(1), 31\u201361 (2008)","journal-title":"Evol. Comput."},{"key":"9226_CR7","unstructured":"Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI-93 (1993)"},{"key":"9226_CR8","unstructured":"Hoos, H.H.: On the run-time behaviour of stochastic local search methods for SAT. In: Proceedings of AAAI, pp. 661\u2013666 (1999)"},{"key":"9226_CR9","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsesvier, New York (2005)"},{"key":"9226_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"9226_CR11","unstructured":"Huyen, V., Olsson, R.: Automatic improvement of graph based image segmentation. In: 8th International Symposium on Visual Computing. Springer, Berlin (2012)"},{"key":"9226_CR12","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J Koza","year":"1992","unstructured":"Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"9226_CR13","doi-asserted-by":"crossref","unstructured":"Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 3569 (2005)","DOI":"10.1007\/11499107_12"},{"key":"9226_CR14","doi-asserted-by":"crossref","unstructured":"Linnaeus, C.: Systema Naturae per Regna Tria Naturae, Secundum Classes, Ordines, Genera, Species Cum Caracteribus, Differentiis, Synonymis, Locis, 10th edn. Laurentii Salvii, Stockholm (1758)","DOI":"10.5962\/bhl.title.542"},{"key":"9226_CR15","doi-asserted-by":"crossref","unstructured":"L\u00f8kketangen, A., Glover, F.: Surrogate constraint analysis: new heuristics and learning schemes for satisfiability problems. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computational Science, vol. 35, pp. 537\u2013572 (1997)","DOI":"10.1090\/dimacs\/035\/14"},{"issue":"6","key":"9226_CR16","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1007\/s10732-009-9119-1","volume":"16","author":"A L\u00f8kketangen","year":"2010","unstructured":"L\u00f8kketangen, A., Olsson, R.: Generating meta-heuristic optimization code using ADATE. J. Heuristics. 16(6), 911\u2013930 (2010)","journal-title":"J. Heuristics."},{"key":"9226_CR17","unstructured":"McAllester, D.A., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of AAAI-97, pp. 321\u2013326 (1997)"},{"key":"9226_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (revised)","author":"R Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML (revised). MIT Press, Cambridge (1997)"},{"key":"9226_CR19","volume-title":"The Statistical Processes of Evolutionary Theory","author":"P Moran","year":"1962","unstructured":"Moran, P.: The Statistical Processes of Evolutionary Theory. Clarendon Press, Oxford (1962)"},{"key":"9226_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0004-3702(94)00042-Y","volume":"1","author":"R Olsson","year":"1995","unstructured":"Olsson, R.: Inductive functional programming using incremental program transformation. Artif. Intell. 1, 55\u201383 (1995)","journal-title":"Artif. Intell."},{"key":"9226_CR21","doi-asserted-by":"crossref","unstructured":"Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: the rprop algorithm. In: International Conference on Neural Networks, San Francisco (1993)","DOI":"10.1109\/ICNN.1993.298623"},{"key":"9226_CR22","volume-title":"Evolution and Optimum Seeking","author":"H-P Schwefel","year":"1995","unstructured":"Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)"},{"key":"9226_CR23","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-92), pp. 440\u2013446 (1992)"},{"key":"9226_CR24","unstructured":"Selman B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI-94), pp. 337\u2013343 (1994)"},{"key":"9226_CR25","doi-asserted-by":"crossref","unstructured":"Selman B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing DIMACS series. In: Discrete Mathematics and Theoretical Computer Science, vol. 26 (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"9226_CR26","doi-asserted-by":"crossref","unstructured":"Smit, S.K., Eiben, A.E.: Beating the \u201cworld champion\u201d evolutionary algorithm via REVAC tuning. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586026"},{"key":"9226_CR27","doi-asserted-by":"crossref","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT: In: Revised Selected Papers of the Seventh International Conferences on Theory and Applications of Satisfiability Testing (SAT-04). LNCS, vol. 3542, pp. 306\u2013320 (2005)","DOI":"10.1007\/11527695_24"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9226-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9226-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9226-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T04:24:05Z","timestamp":1563164645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9226-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,12]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9226"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9226-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,12]]}}}