{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:18Z","timestamp":1725564798215},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219934"},{"type":"electronic","value":"9783540246800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24680-0_149","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T18:50:22Z","timestamp":1283971822000},"page":"944-953","source":"Crossref","is-referenced-by-count":0,"title":["An Approach to Distributed Collaboration Problem with Conflictive Tasks"],"prefix":"10.1007","author":[{"given":"Jingping","family":"Bi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongcheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"149_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M. Naimi","year":"1996","unstructured":"Naimi, M., Trehel, M., Arnold, A.: A log(n) Distributed Mutual Exclusion Algorithm Based on Path Reversal. Journal of Parallel and Distributed Computing\u00a034(1), 1\u201313 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"149_CR2","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/71.862205","volume":"11","author":"S. Lodha","year":"2000","unstructured":"Lodha, S., Kshemkalyani, A.: A Fair Distributed Mutual Exclusion Algorithm. IEEE Transaction on Parallel and Distributed Systems\u00a011(6), 537\u2013549 (2000)","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"149_CR3","unstructured":"Dijkstra, E.W.: Two starvation free solutions to a general exclusion problem. EWD 625, Plataanstraat 5, 5671 AL Nuenen, The Netherlands"},{"issue":"4","key":"149_CR4","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems\u00a06(4), 632\u2013646 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"149_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-45448-9_19","volume-title":"Intelligent Agents VIII","author":"P.J. Modi","year":"2002","unstructured":"Modi, P.J., Jung, H., Tambe, M., Shen, W.M., Kulkarni, S.: Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS (LNAI), vol.\u00a02333, pp. 264\u2013276. Springer, Heidelberg (2002)"},{"issue":"5","key":"149_CR6","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. Journal of Knowledge and Data Engineering\u00a010(5), 673\u2013685 (1998)","journal-title":"Journal of Knowledge and Data Engineering"},{"key":"149_CR7","unstructured":"Wu, Q., Huang, J., Bi, J.: Arbitrator-based Algorithm for Measurement Collaboration Problem. In: Proceedings of the, International Conference on Computer Networks and Mobile Computing (ICCNMC 2003), Shanghai, China, pp. 166\u2013173 (2003)"},{"key":"149_CR8","doi-asserted-by":"crossref","unstructured":"Decker, K., Li, J.: Coordinated hospital patient scheduling. In: Proceedings of the 3rd International Conference on Multi-Agent Systems (ICMAS 1998), Paris, France, pp. 104\u2013111 (1998)","DOI":"10.1109\/ICMAS.1998.699038"},{"key":"149_CR9","doi-asserted-by":"crossref","unstructured":"Kitano, H.: RoboCup Rescue: A Grand Challenge for Multi-Agent Systems. In: Proceedings of ICMAS 2000, Boston, Massachusetts, U.S.A., July 2000, pp. 5\u201312 (2000)","DOI":"10.1109\/ICMAS.2000.858425"}],"container-title":["Lecture Notes in Computer Science","Grid and Cooperative Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24680-0_149.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:02:15Z","timestamp":1619996535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24680-0_149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219934","9783540246800"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24680-0_149","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}