{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:33Z","timestamp":1725560793441},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_26","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:31:28Z","timestamp":1129627888000},"page":"328-342","source":"Crossref","is-referenced-by-count":4,"title":["Search Heuristics and Heavy-Tailed Behaviour"],"prefix":"10.1007","author":[{"given":"Tudor","family":"Hulubei","sequence":"first","affiliation":[]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Achlioptas, D., Gomes, C.P., Kautz, H.A., Selman, B.: Generating satisfiable problem instances. In: Proceedings of AAAI 2000, pp. 256\u2013261 (2000)"},{"key":"26_CR2","unstructured":"Bessi\u00e8re, C., Fern\u00e1ndez, C., Gomes, C.P., Valls, M.: Pareto-like distributions in random binary csp. In: Proceedings of ACIA 2003 (2004)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"C. Bessi\u00e8re","year":"1996","unstructured":"Bessi\u00e8re, C., Regin, J.-C.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 61\u201375. Springer, Heidelberg (1996)"},{"key":"26_CR4","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI 2004, pp. 146\u2013150 (2004)"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Colbourn, C.: Embedding partial steiner triple systems is NP-complete. Combinatorial Theory A(35), 100\u2013105 (1983)","DOI":"10.1016\/0097-3165(83)90031-6"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","volume":"70","author":"I.P. Gent","year":"1994","unstructured":"Gent, I.P., Walsh, T.: Easy problems are sometimes hard. Artificial Intelligence\u00a070, 335\u2013345 (1994)","journal-title":"Artificial Intelligence"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-30201-8_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C.P. Gomes","year":"2004","unstructured":"Gomes, C.P., Fern\u00e1ndez, C., Selman, B., Bessi\u00e8re, C.: Statistical regimes across constrainedness regions. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 32\u201346. Springer, Heidelberg (2004)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.P. Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"issue":"1\/2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C.P. Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Automated Reasoning\u00a024(1\/2), 67\u2013100 (2000)","journal-title":"Automated Reasoning"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014(3), 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","volume":"69","author":"T. Hogg","year":"1994","unstructured":"Hogg, T., Williams, C.P.: The hardest constraint problems: A double phase transition. Artificial Intelligence\u00a069, 359\u2013377 (1994)","journal-title":"Artificial Intelligence"},{"key":"26_CR13","unstructured":"Hulubei, T., O\u2019Sullivan, B.: Optimal refutations for constraint satisfaction problems. In: Proceedings of IJCAI 2005 (2005)"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/(SICI)1520-6610(1996)4:6<405::AID-JCD3>3.0.CO;2-J","volume":"4","author":"M.T. Jacobson","year":"1996","unstructured":"Jacobson, M.T., Matthews, P.: Generating uniformly distributed random latin squares. Combinatorial Design\u00a04, 405\u2013437 (1996)","journal-title":"Combinatorial Design"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Kautz, H.A., Ruan, Y., Achlioptas, D., Gomes, C.P., Selman, B., Stickel, M.E.: Balance and filtering in structured satisfiable problems. In: Proceedings of IJCAI 2001, pp. 351\u2013358 (2001)","DOI":"10.1016\/S1571-0653(04)00310-5"},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence\u00a027(1), 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Boussemart, F., Hemery, F.: Backjump-based techniques versus conflict-directed heuristics. In: Proceedings of ICTAI 2004, pp. 549\u2013557 (2004)","DOI":"10.1109\/ICTAI.2004.37"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of ECAI 1994, pp. 125\u2013129 (1994)","DOI":"10.1007\/3-540-58601-6_86"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-59479-5_23","volume-title":"Constraint Processing","author":"B.M. Smith","year":"1995","unstructured":"Smith, B.M.: In search of exceptionally difficult constraint satisfaction problems. In: Meyer, M. (ed.) Constraint Processing. LNCS, vol.\u00a0923, pp. 139\u2013156. Springer, Heidelberg (1995)"},{"key":"26_CR21","unstructured":"Smith, B.M., Grant, S.: Sparse constraint graphs and exceptionally hard problems. In: Proceedings of IJCAI 1995, pp. 646\u2013651 (1995)"},{"key":"26_CR22","unstructured":"Smith, B.M., Sturdy, P.: An empirical investigation of value ordering for finding all solutions. In: Workshop on Modelling and Solving Problems with Constraints (2004)"},{"key":"26_CR23","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of IJCAI 1999, pp. 1172\u20131177 (1999)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T06:13:29Z","timestamp":1586499209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11564751_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}