{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:23:31Z","timestamp":1725643411756},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259197"},{"type":"electronic","value":"9783642259203"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25920-3_3","type":"book-chapter","created":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T01:12:11Z","timestamp":1323997931000},"page":"27-41","source":"Crossref","is-referenced-by-count":1,"title":["Solving Distributed CSPs Using Dynamic, Partial Centralization without Explicit Constraint Passing"],"prefix":"10.1007","author":[{"given":"Roger","family":"Mailler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Graves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Benisch, M., Sadeh, N.: Examining distributed constraint satisfaction problem (dcsp) coordination tradeoffs. In: International Conference on Automated Agents and Multi-Agent Systems, AAMAS (2006)","DOI":"10.1145\/1160633.1160896"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Culberson, J., Gent, I.: Frozen development in graph coloring. Theoretical Computer Science\u00a0265(1-2), 227\u2013264 (2001)","DOI":"10.1016\/S0304-3975(01)00164-5"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artificial Intelligence\u00a058(1-3), 21\u201370 (1992)","DOI":"10.1016\/0004-3702(92)90004-H"},{"key":"3_CR4","first-page":"294","volume-title":"Proceedings of the Twelfth Natioanl Conference on Artificial Intelligence","author":"D. Frost","year":"1994","unstructured":"Frost, D., Dechter, R.: Dead-end driven learning. In: Proceedings of the Twelfth Natioanl Conference on Artificial Intelligence, pp. 294\u2013300 (1994)"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1613\/jair.2611","volume":"33","author":"T. Grinshpoun","year":"2008","unstructured":"Grinshpoun, T., Meisels, A.: Completeness and performance of the apo algorithm. Journal of Artificial Intelligence Research\u00a033, 223\u2013258 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR6","first-page":"169","volume-title":"The 20th International Conference on Distributed Computing Systems (ICDCS)","author":"K. Hirayama","year":"2000","unstructured":"Hirayama, K., Yokoo, M.: The effect of nogood learning in distributed constraint satisfaction. In: The 20th International Conference on Distributed Computing Systems (ICDCS), pp. 169\u2013177 (2000)"},{"key":"3_CR7","volume-title":"Proceeding of Autonomous Agents and Multi-Agents Systems","author":"R.T. Maheswaran","year":"2005","unstructured":"Maheswaran, R.T., Pearce, J.P., Varakantham, P., Bowring, E., Tambe, M.: Valuations of possible states (vps):a quantitative framework for analysis of privacy loss among collaborative personal assistant agents. In: Proceeding of Autonomous Agents and Multi-Agents Systems (2005)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1613\/jair.1786","volume":"25","author":"Mailler","year":"2006","unstructured":"Mailler, Lesser: Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems. Journal of Artificial Intelligence Research\u00a025, 529\u2013576 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3_CR9","unstructured":"Mailler, R.: A Mediation-Based Approach to Cooperative, Distributed Problem Solving. PhD thesis, University of Massachusetts (2004)"},{"key":"3_CR10","first-page":"438","volume":"2004","author":"R. Mailler","year":"2004","unstructured":"Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: Proceeding of AAMAS-2004, pp. 438\u2013445 (2004)","journal-title":"Proceeding of AAMAS"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Mailler, R., Lesser, V.: A cooperative mediation-based protocol for dynamic, distributed resource allocation. IEEE Transaction on Systems, Man, and Cybernetics, Part C, Special Issue on Game-theoretic Analysis and Stochastic Simulation of Negotiation Agents (2006)","DOI":"10.1109\/TSMCC.2005.860577"},{"key":"3_CR12","first-page":"86","volume-title":"Proc. AAMAS-2002 Workshop on Distributed Constraint Reasoning DCR","author":"A. Meisels","year":"2002","unstructured":"Meisels, A., Razgon, I., Kaplansky, E., Zivan, R.: Comparing performance of distributed constraints processing algorithms. In: Proc. AAMAS-2002 Workshop on Distributed Constraint Reasoning DCR, pp. 86\u201393 (2002)"},{"issue":"1-3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence\u00a058(1-3), 161\u2013205 (1992)","journal-title":"Artificial Intelligence"},{"key":"3_CR14","unstructured":"Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-1994), Seattle, WA, USA, vol, July 31-August 4, vol.\u00a01, pp. 313\u2013318. AAAI Press (1994)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Yokoo, M.: Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In: Int\u2019l Conf. on Principles and Practice of Constraint Programming, pp. 88\u2013102 (1995)","DOI":"10.1007\/3-540-60299-2_6"},{"key":"3_CR16","unstructured":"Yokoo, M., Durfee, E.H.: Distributed constraint optimization as a formal model of partially adversarial cooperation. Technical Report CSE-TR-101-91, University of Michigan, Ann Arbor, MI\u00a048109 (1991)"},{"key":"3_CR17","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 the 12th Int\u2019l Conf. on Distributed Computing Systems, pp. 614\u2013621 (1992)","DOI":"10.1109\/ICDCS.1992.235101"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1023\/A:1010078712316","volume":"3","author":"M. Yokoo","year":"2000","unstructured":"Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems\u00a03(2), 198\u2013212 (2000)","journal-title":"Autonomous Agents and Multi-Agent Systems"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25920-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:38:29Z","timestamp":1561077509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25920-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259197","9783642259203"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25920-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}