{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:23:48Z","timestamp":1740029028357,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,20]],"date-time":"2010-04-20T00:00:00Z","timestamp":1271721600000},"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":[[2011,6]]},"DOI":"10.1007\/s10732-010-9134-2","type":"journal-article","created":{"date-parts":[[2010,4,19]],"date-time":"2010-04-19T16:36:12Z","timestamp":1271694972000},"page":"251-279","source":"Crossref","is-referenced-by-count":5,"title":["Boosting distributed constraint satisfaction"],"prefix":"10.1007","volume":"17","author":[{"given":"Youssef","family":"Hamadi","sequence":"first","affiliation":[]},{"given":"Georg","family":"Ringwelski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,20]]},"reference":[{"key":"9134_CR1","unstructured":"Armstrong, A., Durfee, E.: Dynamic prioritization of complex agents in distributed constraint satisfaction problems. In: Proc. of the 15th Int. Joint Conf. on AI (IJCAI-97), pp.\u00a0620\u2013625 (1997)"},{"key":"9134_CR2","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Regin, J.C.: Mac and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: CP, pp. 61\u201375 (1996)","DOI":"10.1007\/3-540-61551-2_66"},{"key":"9134_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.artint.2004.10.002","volume":"161","author":"C. Bessiere","year":"2005","unstructured":"Bessiere, C., Brito, I., Maestre, A., 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":"9134_CR4","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: A comparative survey. ACM Comput. Surv. 38(4) (2006)","DOI":"10.1145\/1177352.1177354"},{"issue":"4","key":"9134_CR5","first-page":"35","volume":"27","author":"B.G. Buchanan","year":"2006","unstructured":"Buchanan, B.G.: What do\u00a0we know about knowledge? AI Mag. 27(4), 35\u201346 (2006)","journal-title":"AI Mag."},{"key":"9134_CR6","unstructured":"Carchrae, T., Beck, J.C.: Low knowledge algorithm control. In: Proc. AAAI\u201904 (2004)"},{"issue":"1","key":"9134_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K.M. Chandy","year":"1985","unstructured":"Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63\u201375 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9134_CR8","unstructured":"Fitzpatrick, S., Meertens, L.: Scalable, anytime constraint optimization through iterated, peer-to-peer interaction in sparsely-connected networks. In: Proc. IDPT\u201902 (2002)"},{"key":"9134_CR9","unstructured":"Gent, I., Walsh, T.: CSPLib, a problem library for constraints, http:\/\/www-users.cs.york.ac.uk\/tw\/csplib\/"},{"key":"9134_CR10","unstructured":"Gershman, A., Zivan, R., Grinshpoun, T., Meisels, A.: Measuring distributed constraint optimization algorithms. In: AAMAS DCR (2008)"},{"key":"9134_CR11","first-page":"233","volume-title":"Constraint and Integer Programming: Toward a Unified Methodology","author":"C. Gomes","year":"2003","unstructured":"Gomes, C.: Randomized backtrack search. In: Milano, M. (ed.) Constraint and Integer Programming: Toward a Unified Methodology, pp. 233\u2013283. Kluwer, Dordrecht (2003)"},{"key":"9134_CR12","unstructured":"Gomes, C., Selman, B.: Algorithm portfolio design: Theory vs. practice. In: Proc. UAI\u201997, pp.\u00a0190\u2013197 (1997)"},{"key":"9134_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C. Gomes","year":"2001","unstructured":"Gomes, C., Selman, B.: Algorithm portfolios. Artif. Intel. 126, 43\u201362 (2001)","journal-title":"Artif. Intel."},{"key":"9134_CR14","first-page":"431","volume-title":"Proc. AAAI\u201998","author":"C. Gomes","year":"1998","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proc. AAAI\u201998, pp. 431\u2013438. AAAI Press, Menlo Park (1998)"},{"key":"9134_CR15","doi-asserted-by":"crossref","unstructured":"Greenstadt, R., Grosz, B.J., Smith, M.D.: Ssdpop: Improving the privacy of dcop with secret sharing. In: AAMAS, p.\u00a0171 (2007)","DOI":"10.1145\/1329125.1329333"},{"key":"9134_CR16","doi-asserted-by":"crossref","unstructured":"Hamadi, Y.: Optimal distributed arc-consistency. In: Proc. CP\u201999, pp.\u00a0219\u2013233 (1999)","DOI":"10.1007\/978-3-540-48085-3_16"},{"issue":"2","key":"9134_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1142\/S0218213002000836","volume":"11","author":"Y. Hamadi","year":"2002","unstructured":"Hamadi, Y.: Interleaved backtracking in distributed constraint networks. Int. J. Artif. Intel. Tools 11(2), 167\u2013188 (2002)","journal-title":"Int. J. Artif. Intel. Tools"},{"key":"9134_CR18","unstructured":"Hamadi, Y., Bessiere, C., Quinqueton, J.: Backtracking in distributed constraint networks. In: Proc. ECAI\u201998, pp.\u00a0219\u2013223 (1998)"},{"key":"9134_CR19","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: Manysat: Solver description. Tech. rep. MSR-TR-2008-83, Microsoft Research (2008)"},{"key":"9134_CR20","first-page":"245","volume":"6","author":"Y. Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: A parallel SAT solver. J. Satisf. Boolean Model. Comput. 6, 245\u2013262 (2009)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"9134_CR21","doi-asserted-by":"crossref","unstructured":"Hill, B.: A simple general approach to inference about the tail of a distribution. Ann. Stat. 1163\u20131174 (1975)","DOI":"10.1214\/aos\/1176343247"},{"key":"9134_CR22","series-title":"SFI Studies in the Sciences of Complexity","first-page":"165","volume-title":"1992 Lectures in Complex Systems","author":"T. Hogg","year":"1993","unstructured":"Hogg, T., Huberman, B.A.: Better than the best: The power of cooperation. In: 1992 Lectures in Complex Systems. SFI Studies in the Sciences of Complexity, vol. 5, pp.\u00a0165\u2013184. Addison-Wesley, Reading (1993)"},{"key":"9134_CR23","first-page":"95","volume":"2","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks and the ordering of events in distributed systems. Commun. ACM 2, 95\u2013104 (1978)","journal-title":"Commun. ACM"},{"key":"9134_CR24","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc. IJCAI\u201903, p.\u00a01542 (2003)"},{"key":"9134_CR25","doi-asserted-by":"crossref","unstructured":"Modi, P.J., Shen, W.-M., Tambe, M., Yokoo, M..: Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artif. Intel. 161 (2005)","DOI":"10.1016\/j.artint.2004.09.003"},{"key":"9134_CR26","doi-asserted-by":"crossref","unstructured":"Otten, L., Gr\u00f6nkvist, M., Dubhashi, D.P.: Randomization in constraint programming for airline planning. In: CP, pp.\u00a0406\u2013420 (2006)","DOI":"10.1007\/11889205_30"},{"key":"9134_CR27","series-title":"LNCS","first-page":"5","volume-title":"Proc. CP\u201904, Invited Talk","author":"J.F. Puget","year":"2004","unstructured":"Puget, J.F.: Some challenges for constraint programming: an industry view. In: Proc. CP\u201904, Invited Talk. LNCS, vol.\u00a03258, pp. 5\u20139. Springer, Berlin (2004)"},{"key":"9134_CR28","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J.R. Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"9134_CR29","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/11564751_41","volume-title":"Principles and Practice of Constraint Programming","author":"G. Ringwelski","year":"2005","unstructured":"Ringwelski, G., Hamadi, Y.: Boosting distributed constraint satisfaction. In: Beek, P. (ed.): Principles and Practice of Constraint Programming. LNCS, vol.\u00a03709, pp. 549\u2013562. Springer, Berlin (2005)"},{"key":"9134_CR30","doi-asserted-by":"crossref","unstructured":"Silaghi, M.-C., Faltings, B.: Asynchronous aggregation and consistency in distributed constraint satisfaction. Artif. Intel. 161 (2005)","DOI":"10.1016\/j.artint.2004.10.003"},{"key":"9134_CR31","doi-asserted-by":"crossref","unstructured":"Silaghi, M.-C., Sam-Haroud, D., Faltings, B.: Asynchronous search with aggregations. In: Proc. AAAI\/IAAI 2000, pp.\u00a0917\u2013922 (2000)","DOI":"10.1142\/9789812811042_0054"},{"key":"9134_CR32","unstructured":"Silaghi, M., Lass, R., Sultanik, E., Regli, W., Matsui, T., Yokoo, M.: The operation point units of distributed constraint solvers. In: AAMAS DCR (2008)"},{"key":"9134_CR33","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: The design and analysis of an algorithm portfolio for sat. In: CP, pp.\u00a0712\u2013727 (2007)","DOI":"10.1007\/978-3-540-74970-7_50"},{"key":"9134_CR34","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Durfee, E.H.: The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Trans. Knowl. Data Eng. 10(5) (1998)","DOI":"10.1109\/69.729707"},{"key":"9134_CR35","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proc. ICDCS\u201992, pp.\u00a0614\u2013621 (1992)","DOI":"10.1109\/ICDCS.1992.235101"},{"key":"9134_CR36","unstructured":"Zivan, R., Meisels, A.: Synchronous vs asynchronous search on DisCSPs. In: Proc. EUMAS\u201903 (2003)"},{"key":"9134_CR37","unstructured":"Zivan, R., Meisels, A.: Concurrent search for distributed csps. Artif. Intel. 161 (2005)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9134-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9134-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9134-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T02:20:30Z","timestamp":1740018030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9134-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,20]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9134"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9134-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2010,4,20]]}}}