{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:14:13Z","timestamp":1725574453922},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405504"},{"type":"electronic","value":"9783540450801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45080-1_5","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T23:54:03Z","timestamp":1294358043000},"page":"35-42","source":"Crossref","is-referenced-by-count":3,"title":["Agent Compromises in Distributed Problem Solving"],"prefix":"10.1007","author":[{"given":"Yi","family":"Tang","sequence":"first","affiliation":[]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiaolong","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C.P. Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of automated reasoning\u00a024, 67\u2013100 (2000)","journal-title":"Journal of automated reasoning"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J. Gu","year":"1992","unstructured":"Gu, J.: Efficient local search for very large-scale satisfiability problem. SIGART Bulletin\u00a03, 8\u201312 (1992)","journal-title":"SIGART Bulletin"},{"key":"5_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-48238-5_25","volume-title":"KI-99: Advances in Artificial Intelligence","author":"H.H. Hoos","year":"1999","unstructured":"Hoos, H.H., Stutzle, T.: Systematic vs. Local Search for SAT. In: Burgard, W., Christaller, T., Cremers, A.B. (eds.) KI 1999. LNCS (LNAI), vol.\u00a01701, pp. 289\u2013293. Springer, Heidelberg (1999)"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F. Leighton","year":"1979","unstructured":"Leighton, F.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards\u00a084, 489\u2013503 (1979)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0004-3702(01)00174-6","volume":"138","author":"J. Liu","year":"2002","unstructured":"Liu, J., Jing, H., Tang, Y.Y.: Multi-agent oriented constraint satisfaction. Artificial Intelligence\u00a0138, 101\u2013144 (2002)","journal-title":"Artificial Intelligence"},{"key":"5_CR6","first-page":"9","volume":"57","author":"A. Nareyek","year":"2001","unstructured":"Nareyek, A.: Using global constraints for local search, Constraint Programming and Large Scale Discrete Optimization. DIMACS\u00a057, 9\u201328 (2001)","journal-title":"DIMACS"},{"key":"5_CR7","unstructured":"Schuurmans, D., Southey, F., Holte, R.C. In: Proceedings of the 17th International Joint Conference On Artificial Intelligence (IJCAI 2001), pp. 334\u2013341 (2001)"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008287028851","volume":"12","author":"Y. Shang","year":"1998","unstructured":"Shang, Y., Wah, B.W.: A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of global optimization\u00a012(1), 61\u201399 (1998)","journal-title":"Journal of global optimization"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M. Yokoo","year":"1998","unstructured":"Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transaction on Knowledge and Data Engineering\u00a010(5), 673\u2013685 (1998)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"5_CR10","unstructured":"http:\/\/mat.gsia.cmu.edu\/COLOR02"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45080-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T05:50:02Z","timestamp":1553320202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45080-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405504","9783540450801"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45080-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}