{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:41Z","timestamp":1742914001598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501260"},{"type":"electronic","value":"9783319501277"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50127-7_23","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T01:04:06Z","timestamp":1480381446000},"page":"281-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Assignment Precipitation in Fail First Search"],"prefix":"10.1007","author":[{"given":"Majid","family":"Namazi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"G. Ghooshchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A. Hakim","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,29]]},"reference":[{"issue":"3\u20134","key":"23_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3233\/FI-2010-307","volume":"102","author":"T Balafoutis","year":"2010","unstructured":"Balafoutis, T., Stergiou, K.: Evaluating and improving modern variable and revision ordering strategies in CSPs. Fundam. Inform. 102(3\u20134), 229\u2013261 (2010)","journal-title":"Fundam. Inform."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Bouyakhf, E.H., Mechqrane, Y., Wahbi, M.: Agile asynchronous backtracking for distributed csps. In: ICTAI, pp. 777\u2013784 (2011)","DOI":"10.1109\/ICTAI.2011.122"},{"key":"23_CR3","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol. 16, p. 146 (2004)"},{"key":"23_CR4","unstructured":"Chen, X., Van Beek, P.: Conflict-directed backjumping revisited. arXiv preprint arXiv:1106.0254 (2011)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"ML Ginsberg","year":"1993","unstructured":"Ginsberg, M.L.: Dynamic backtracking. JAIR 1, 25\u201346 (1993)","journal-title":"JAIR"},{"key":"23_CR6","first-page":"2318","volume":"7","author":"J Huang","year":"2007","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. IJCAI 7, 2318\u20132323 (2007)","journal-title":"IJCAI"},{"key":"23_CR7","unstructured":"McAllester, D.A.: Partial order backtracking. JAIR 1 (1993)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-319-23219-5_33","volume-title":"Principles and Practice of Constraint Programming","author":"M Wahbi","year":"2015","unstructured":"Wahbi, M., Mechqrane, Y., Bessiere, C., Brown, K.N.: A general framework for reordering agents asynchronously in distributed CSP. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 463\u2013479. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23219-5_33"},{"key":"23_CR9","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: IJCAI, vol. 3, pp. 1173\u20131178. Citeseer (2003)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1007\/11889205_67","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"R Zivan","year":"2006","unstructured":"Zivan, R., Shapen, U., Zazone, M., Meisels, A.: Retroactive ordering for dynamic backtracking. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 766\u2013771. Springer, Heidelberg (2006). doi:10.1007\/11889205_67"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-19486-3_9","volume-title":"Recent Advances in Constraints","author":"R Zivan","year":"2011","unstructured":"Zivan, R., Shapen, U., Zazone, M., Meisels, A.: MAC-DBT revisited. In: Larrosa, J., O\u2019Sullivan, B. (eds.) CSCLP 2009. LNCS (LNAI), vol. 6384, pp. 139\u2013153. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-19486-3_9"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10601-008-9046-z","volume":"14","author":"R Zivan","year":"2009","unstructured":"Zivan, R., Zazone, M., Meisels, A.: Min-domain retroactive ordering for asynchronous backtracking. Constraints 14(2), 177\u2013198 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","AI 2016: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50127-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T19:05:16Z","timestamp":1699297516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50127-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501260","9783319501277"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50127-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"29 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hobart, TAS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ai2016.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}