乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:57:40Z","timestamp":1725937060839},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319727509"},{"type":"electronic","value":"9783319727516"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72751-6_9","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:03:05Z","timestamp":1514631785000},"page":"114-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Searching for a Non-adversarial, Uncooperative Agent on a Cycle"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Maxime","family":"Godon","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Toshinori","family":"Sakai","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"key":"9_CR1","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley-Interscience, Hoboken (1987)"},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/b100809","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Springer, Boston (2003). \nhttps:\/\/doi.org\/10.1007\/b100809"},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza Yates","year":"1993","unstructured":"Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"issue":"4","key":"9_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Isr. J. Math. 2(4), 221\u2013228 (1964)","journal-title":"Isr. J. Math."},{"issue":"3","key":"9_CR5","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search. Siam Rev. 5(3), 274 (1963)","journal-title":"Siam Rev."},{"key":"9_CR6","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs. AMS, Providence (2011)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-57586-5_10","volume-title":"Algorithms and Complexity","author":"S Brandt","year":"2017","unstructured":"Brandt, S., Laufenberg, F., Lv, Y., Stolz, D., Wattenhofer, R.: Collaboration without communication: evacuating two robots from a disk. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 104\u2013115. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-57586-5_10"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-45174-8_9"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-18173-8_10","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication (Extended Abstract). In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 140\u2013152. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18173-8_10\n\n. CoRR abs\/1501.04985"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-19662-6_13","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Wireless autonomous robot evacuation from equilateral triangles and squares. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 181\u2013194. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19662-6_13"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45249-9_1","volume-title":"Distributed Computing and Networking","author":"O Feinerman","year":"2014","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1\u201313. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45249-9_1"},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-19662-6_14","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"E Huus","year":"2015","unstructured":"Huus, E., Kranakis, E.: Rendezvous of many agents with different speeds in a cycle. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 195\u2013209. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19662-6_14"},{"issue":"1","key":"9_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1), 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., MacQuarrie, F., Shende, S.: Randomized rendezvous algorithms for agents on a ring with different speeds. In: ICDCN, Goa, India, 4\u20137 January, pp. 9:1\u20139:10 (2015)","DOI":"10.1145\/2684464.2684468"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-51963-0_7","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"E Kranakis","year":"2017","unstructured":"Kranakis, E., Krizanc, D., Markou, E., Pagourtzis, A., Ram\u00edrez, F.: Different speeds suffice for rendezvous of two agents on arbitrary graphs. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 79\u201390. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-51963-0_7"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72751-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:05:43Z","timestamp":1514631943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}