{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:49:28Z","timestamp":1743036568229,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_5","type":"book-chapter","created":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T01:12:11Z","timestamp":1323997931000},"page":"58-73","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive and Non-adaptive Distribution Functions for DSA"],"prefix":"10.1007","author":[{"given":"Melanie","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Mailler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Bacchus, F., van Beek, P.: On the conversion between non-binary constraint satisfaction problems. In: AAAI 1998\/IAAI 1998: Proceedings of the Fifteenth National\/Tenth Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence, pp. 311\u2013318. American Association for Artificial Intelligence, Menlo Park (1998)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1145\/380752.380868","volume-title":"STOC 2001: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing","author":"A. Bulatov","year":"2001","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: STOC 2001: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 667\u2013674. ACM, New York (2001)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Faltings, B.: Distributed constraint programming. In: van Beek, P., Rossi, F., Walsh, T. (eds.) Handbook of Constraint Programming. Foundations of Artificial Intelligence, ch. 20, vol.\u00a02, pp. 699\u2013729. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80024-6"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Fitzpatrick, S., Meertens, L.: Distributed Coordination Through Anarchic Optimization. In: Distributed Sensor Networks: A Multiagent Perspective, pp. 257\u2013294. Kluwer Academic Publishers (2003)","DOI":"10.1007\/978-1-4615-0363-7_11"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Mailler, R.: Using prior knowledge to improve distributed hill climbing. In: Proceedings of the 2006 International Conference on Intelligent Agent Technology (IAT 2006) (2006)","DOI":"10.1109\/IAT.2006.129"},{"key":"5_CR6","unstructured":"Mailler, R., Lesser, V.: Using Cooperative Mediation to Solve Distributed Constraint Satisfaction Problems. In: Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2004) (2004)"},{"key":"5_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-040-7","volume-title":"Distributed search by constrained agents: algorithms, performance, communication","author":"A. Meisels","year":"2008","unstructured":"Meisels, A.: Distributed search by constrained agents: algorithms, performance, communication. Springer, Heidelberg (2008)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1162\/neco.1989.1.2.281","volume":"1","author":"J. Moody","year":"1989","unstructured":"Moody, J., Darken, C.J.: Fast learning in networks of locally-tuned processing units. Neural Comput.\u00a01(2), 281\u2013294 (1989)","journal-title":"Neural Comput."},{"key":"5_CR9","unstructured":"Morris, P.: The breakout method for escaping local minima. In: Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 40\u201345 (1993)"},{"key":"5_CR10","volume-title":"Reinforcement Learning: An Introduction","author":"A.G.B. Richard","year":"1999","unstructured":"Richard, A.G.B., Sutton, S.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1999)"},{"key":"5_CR11","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), pp. 337\u2013343 (1994)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Smith, M., Mailler, R.: Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth It?. In: Int\u2019l Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT (2010)","DOI":"10.1109\/WI-IAT.2010.31"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-60299-2_6","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"M. Yokoo","year":"1995","unstructured":"Yokoo, M.: Asynchronous Weak-Commitment Search for Solving Distributed Constraint Satisfaction Problems. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 88\u2013102. Springer, Heidelberg (1995)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: International Conference on Distributed Computing Systems, pp. 614\u2013621 (1992)","DOI":"10.1109\/ICDCS.1992.235101"},{"key":"5_CR15","unstructured":"Yokoo, M., Hirayama, K.: Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: International Conference on Multi-Agent Systems, ICMAS (1996)"},{"key":"5_CR16","unstructured":"Zhang, W., Wang, G., Wittenburg, L.: Distributed stochastic search for constraint satisfaction and optimization: Parallelism, phase transitions and performance. In: Proceedings of the AAAI Workshop on Probabilistic Approaches in Search, pp. 53\u201359 (2002)"},{"key":"5_CR17","unstructured":"Zhang, W., Wittenburg, L.: Distributed breakout revisited. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), pp. 352\u2013357 (2002)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25920-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T22:58:32Z","timestamp":1742079512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25920-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259197","9783642259203"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25920-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}