乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T21:51:15Z","timestamp":1726091475269},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_5","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T07:04:28Z","timestamp":1596006268000},"page":"80-90","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Lower Bounds for Shoreline Search"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Pardubsk\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"5_CR1","unstructured":"Acharjee, S., Georgiou, K., Kundu, S., Srinivasan, A.: Lower bounds for shoreline searching with 2 or more robots. In: OPODIS (2019)"},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6825-7","volume-title":"Search Theory: A Game Theoretic Perspective","author":"S Alpern","year":"2013","unstructured":"Alpern, S., Fokkink, R., Gasieniec, L., Lindelauf, R., Subrahmanian, V.: Search Theory: A Game Theoretic Perspective. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/b100809","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2006","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/b100809"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"R Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. 5(3), 143\u2013154 (1995)","journal-title":"Comput. Geom."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-19487-8_20","volume-title":"SWAT 88","author":"RA Baeza-Yates","year":"1988","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching with uncertainty extended abstract. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 176\u2013189. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19487-8_20"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching with uncertainty (technical report 239). Indiana University, Computer Science Department (1988)","DOI":"10.1007\/3-540-19487-8_20"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9904-1956-10021-9","volume":"62","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: A minimization problem. Bull. AMS 62(3), 270 (1956)","journal-title":"Bull. AMS"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"SJ Benkoski","year":"1991","unstructured":"Benkoski, S.J., Monticino, M.G., Weisinger, J.R.: A survey of the search theory literature. Naval Res. Logist. (NRL) 38(4), 469\u2013494 (1991)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-11072-7_14","volume-title":"Distributed Computing by Mobile Entities","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 335\u2013370. Springer, Cham (2019)"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1287\/opre.16.3.525","volume":"16","author":"JM Dobbie","year":"1968","unstructured":"Dobbie, J.M.: A survey of search theory. Oper. Res. 16(3), 525\u2013537 (1968)","journal-title":"Oper. Res."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gal, S.: Search games. In: Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0912"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/nav.3800080108","volume":"8","author":"B Gluss","year":"1961","unstructured":"Gluss, B.: An alternative solution to the \u201clost at sea\u201d problem. Naval Res. Logist. Q. 8(1), 117\u2013122 (1961)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800080404","volume":"8","author":"B Gluss","year":"1961","unstructured":"Gluss, B.: The minimax path in a search for a circle in a plane. Naval Res. Logist. Q. 8(4), 357\u2013360 (1961)","journal-title":"Naval Res. Logist. Q."},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800040409","volume":"4","author":"JR Isbell","year":"1957","unstructured":"Isbell, J.R.: An optimal search pattern. Naval Res. Logist. Q. 4(4), 357\u2013359 (1957)","journal-title":"Naval Res. Logist. Q."},{"issue":"11","key":"5_CR15","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"109","author":"A Je\u017c","year":"2009","unstructured":"Je\u017c, A., \u0141opusza\u0144ski, J.: On the two-dimensional cow search problem. Inf. Proc. Lett. 109(11), 543\u2013547 (2009)","journal-title":"Inf. Proc. Lett."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Langetepe, E.: On the optimality of spiral search, pp. 1\u201312, January 2010","DOI":"10.1137\/1.9781611973075.1"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2011.12.069","volume":"447","author":"E Langetepe","year":"2012","unstructured":"Langetepe, E.: Searching for an axis-parallel shoreline. Theor. Comput. Sci. 447, 85\u201399 (2012)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T21:21:01Z","timestamp":1667596861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}