{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:11:38Z","timestamp":1748578298928,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_33","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"463-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A General Framework for Reordering Agents Asynchronously in Distributed CSP"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Wahbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Younes","family":"Mechqrane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Bessiere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Bouyakhf, E.H., Mechqrane, Y., Wahbi, M.: Agile asynchronous backtracking for distributed constraint satisfaction problems. In: Proceedings of ICTAI 2011, Boca Raton, Florida, USA, pp. 777\u2013784, November 2011","DOI":"10.1109\/ICTAI.2011.122"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.artint.2004.10.002","volume":"161","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., Maestre, A., Brito, I., Meseguer, P.: Asynchronous backtracking without adding links: a new member in the ABT family. Artif. Intel. 161, 7\u201324 (2005)","journal-title":"Artif. Intel."},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"C Bessiere","year":"1996","unstructured":"Bessiere, C., R\u00e9gin, J.C.: MAC and combined heuristics: two reasons toforsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61\u201375. Springer, Heidelberg (1996)"},{"key":"33_CR4","unstructured":"Bessiere, C., R\u00e9gin, J.C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI 2001, San Francisco, CA, USA, pp. 309\u2013315 (2001)"},{"key":"33_CR5","unstructured":"Bliek, C.: Generalizing partial order and dynamic backtracking. In: Proceedings of AAAI 1998\/IAAI 1998, Menlo Park, CA, USA, pp. 319\u2013325 (1998)"},{"key":"33_CR6","unstructured":"Bonnet-Torr\u00e9s, O., Tessier, C.: Multiply-constrained dcop for distributed planning and scheduling. In: AAAI SSS: Distributed Plan and Schedule Management, pp. 17\u201324 (2006)"},{"key":"33_CR7","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI 2004, pp. 146\u2013150 (2004)"},{"key":"33_CR8","doi-asserted-by":"crossref","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":"33_CR9","doi-asserted-by":"crossref","unstructured":"Ginsberg, M.L., McAllester, D.A.: GSAT and dynamic backtracking. In: KR, pp. 226\u2013237 (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50117-2"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intel. 14(3), 263\u2013313 (1980)","journal-title":"Artif. Intel."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Jung, H., Tambe, M., Kulkarni, S.: Argumentation as distributed constraint satisfaction: applications and results. In: Proceedings of AGENTS 2001, pp. 324\u2013331 (2001)","DOI":"10.1145\/375735.376322"},{"key":"33_CR12","unstructured":"Junges, R., Bazzan, A.L.C.: Evaluating the performance of dcop algorithms in a real world, dynamic problem. In: Proceedings of AAMAS 2008, Richland, SC, pp. 599\u2013606 (2008)"},{"key":"33_CR13","unstructured":"L\u00e9aut\u00e9, T., Faltings, B.: Coordinating logistics operations with privacy guarantees. In: Proceedings of the IJCAI 2011, pp. 2482\u20132487 (2011)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Boussemart, F., Hemery, F.: Backjump-based techniques versus conflict-directed heuristics. In: Proceedings of IEEE ICTAI 2004, pp. 549\u2013557 (2004)","DOI":"10.1109\/ICTAI.2004.37"},{"key":"33_CR15","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Series (1997)"},{"key":"33_CR16","unstructured":"Maheswaran, R.T., Tambe, M., Bowring, E., Pearce, J.P., Varakantham, P.: Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling. In: Proceedings of AAMAS 2004 (2004)"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/s10601-012-9122-2","volume":"17","author":"Y Mechqrane","year":"2012","unstructured":"Mechqrane, Y., Wahbi, M., Bessiere, C., Bouyakhf, E.H., Meisels, A., Zivan, R.: Corrigendum to \u201cMin-Domain Retroactive Ordering for Asynchronous Backtracking\". Constraints 17, 348\u2013355 (2012)","journal-title":"Constraints"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Ottens, B., Faltings, B.: Coordination agent plans trough distributed constraint optimization. In: Proceedings of MASPLAN 2008, Sydney, Australia (2008)","DOI":"10.1109\/WIIAT.2008.177"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11402763_7","volume-title":"Recent Advances in Constraints","author":"A Petcu","year":"2005","unstructured":"Petcu, A., Faltings, B.V.: A value ordering heuristic for local search in distributed resource allocation. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 86\u201397. Springer, Heidelberg (2005)"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Roussel, O., Lecoutre, C.: Xml representation of constraint networks: Format XCSP 2.1. CoRR (2009)","DOI":"10.1002\/9780470611821"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Silaghi, M.C.: Framework for modeling reordering heuristics for asynchronous backtracking. In: IEEE\/WIC\/ACM International Conference on Intelligent Agent Technology, IAT 2006, pp. 529\u2013536, December 2006","DOI":"10.1109\/IAT.2006.68"},{"key":"33_CR22","unstructured":"Silaghi, M.C.: Generalized dynamic ordering for asynchronous backtracking on DisCSPs. In: Proceedings of DCR 2006 (2006)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Silaghi, M.C., Sam-Haroud, D., Faltings, B.: ABT with Asynchronous Reordering. In: 2nd Asia-Pacific IAT (2001)","DOI":"10.1142\/9789812811042_0007"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Silaghi, M.C., Sam-Haroud, D., Calisti, M., Faltings, B.: Generalized english auctions by relaxation in dynamic distributed CSPs with private constraints. In: Proceedings of DCR 2001, pp. 45\u201354 (2001)","DOI":"10.1142\/9789812811042_0007"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Wahbi, M.: Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. John Wiley & Sons, Inc. (2013)","DOI":"10.1002\/9781118753620"},{"key":"33_CR26","unstructured":"Wahbi, M., Ezzahir, R., Bessiere, C., Bouyakhf, E.H.: DisChoco 2: a platform for distributed constraint reasoning. In: Proceedings of workshop on DCR 2011, pp. 112\u2013121 (2011). http:\/\/dischoco.sourceforge.net\/"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proceedings of ICDCS, pp. 614\u2013621 (1992)","DOI":"10.1109\/ICDCS.1992.235101"},{"key":"33_CR28","unstructured":"Zivan, R., Meisels, A.: Parallel Backtrack search on DisCSPs. In: Proceedings of DCR 2002 (2002)"},{"issue":"2\u20133","key":"33_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10601-006-8062-0","volume":"11","author":"R Zivan","year":"2006","unstructured":"Zivan, R., Meisels, A.: Dynamic Ordering for Asynchronous Backtracking on DisCSPs. Constraints 11(2\u20133), 179\u2013197 (2006)","journal-title":"Constraints"},{"issue":"4","key":"33_CR30","first-page":"415","volume":"46","author":"R Zivan","year":"2006","unstructured":"Zivan, R., Meisels, A.: Message delay and DisCSP search algorithms. AMAI 46(4), 415\u2013439 (2006)","journal-title":"AMAI"},{"issue":"2","key":"33_CR31","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","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:47:59Z","timestamp":1748562479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}