{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:27:05Z","timestamp":1763105225561},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037504"},{"type":"electronic","value":"9783642037511"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03751-1_3","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T05:27:42Z","timestamp":1251782862000},"page":"31-45","source":"Crossref","is-referenced-by-count":5,"title":["Estimating Bounds on Expected Plateau Size in MAXSAT Problems"],"prefix":"10.1007","author":[{"given":"Andrew M.","family":"Sutton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele E.","family":"Howe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Darrell","family":"Whitley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.7","volume":"1","author":"I.P. Gent","year":"1993","unstructured":"Gent, I.P., Walsh, T.: An empirical analysis of search in GSAT. Journal of Artificial Intelligence Research\u00a01, 47\u201359 (1993)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR2","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of AAAI 1992, San Jose, CA (1992)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2003.01.005","volume":"166","author":"M. Mastrolilli","year":"2005","unstructured":"Mastrolilli, M., Gambardella, L.M.: How good are tabu search and plateau moves in the worst case? European Journal of Operations Research\u00a0166, 63\u201376 (2005)","journal-title":"European Journal of Operations Research"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1613\/jair.445","volume":"7","author":"J. Frank","year":"1997","unstructured":"Frank, J., Cheeseman, P., Stutz, J.: When gravity fails: Local search topology. Journal of Artificial Intelligence Research\u00a07, 249\u2013281 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1090\/dimacs\/026\/21","volume":"26","author":"S. Hampson","year":"1993","unstructured":"Hampson, S., Kibler, D.: Plateaus and plateau search in boolean satisfiability problems: When to give up searching and start again. DIMACS Series in Discrete Math and Theoretical Computer Science\u00a026, 437\u2013453 (1993)","journal-title":"DIMACS Series in Discrete Math and Theoretical Computer Science"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BFb0017451","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"M. Yokoo","year":"1997","unstructured":"Yokoo, M.: Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 356\u2013370. Springer, Heidelberg (1997)"},{"key":"3_CR7","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)"},{"key":"3_CR8","unstructured":"Smyth, K.R.G.: Understanding stochastic local search algorithms: An empirical analysis of the relationship between search space structure and algorithm behaviour. Master\u2019s thesis, University of British Columbia (2004)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0096-3003(99)00166-6","volume":"117","author":"C.M. Reidys","year":"2001","unstructured":"Reidys, C.M., Stadler, P.F.: Neutrality in fitness landscapes. Applied Mathematics and Computation\u00a0117, 321\u2013350 (2001)","journal-title":"Applied Mathematics and Computation"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02462007","volume":"59","author":"C. Reidys","year":"1997","unstructured":"Reidys, C., Stadler, P., Schuster, P.: Generic properties of combinatory maps and neutral networks of RNA secondary structures. Bull. Math. Biol.\u00a059, 339\u2013397 (1997)","journal-title":"Bull. Math. Biol."},{"key":"3_CR11","volume-title":"Introduction to Percolation Theory","author":"D. Stauffer","year":"1991","unstructured":"Stauffer, D., Aharony, A.: Introduction to Percolation Theory. Routledge, New York (1991)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Schuster, P., Fontana, W., Stadler, P.F., Hofacker, I.L.: From sequences to shapes and back: a case study in RNA secondary structures. In: Proceedings of the Royal Society London B, vol.\u00a0255, pp. 279\u2013284 (1994)","DOI":"10.1098\/rspb.1994.0040"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Johnson, D.S., Trick, M.A. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. AMS, Providence (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"3_CR14","first-page":"73","volume-title":"Hybrid Problems, Hybrid Solutions","author":"I. Gent","year":"1995","unstructured":"Gent, I., Walsh, T.: Unsatisfied variables in local search. In: Hallam, J. (ed.) Hybrid Problems, Hybrid Solutions, pp. 73\u201385. IOS Press, Amsterdam (1995)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3_CR16","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2003 (2003)"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research\u00a032, 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03751-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T05:17:23Z","timestamp":1558502243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03751-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037504","9783642037511"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03751-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}