{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:57:39Z","timestamp":1725937059093},"publisher-location":"Cham","reference-count":21,"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_7","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T11:03:05Z","timestamp":1514631785000},"page":"84-97","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Querying with Uncertainty"],"prefix":"10.1007","author":[{"given":"Huda","family":"Chuangpishit","sequence":"first","affiliation":[]},{"given":"Kostantinos","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Aronov, B., Har-Peled, S., Phillips, J.M., Yi, K., Zhang, W.: Nearest neighbor searching under uncertainty ii. In: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 115\u2013126. ACM (2013)","DOI":"10.1145\/2463664.2465219"},{"key":"7_CR2","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley-Interscience, Hoboken (1987)"},{"key":"7_CR3","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"7_CR4","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, Heidelberg (2003). https:\/\/doi.org\/10.1007\/b100809"},{"issue":"2","key":"7_CR5","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":"7_CR6","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":"2","key":"7_CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02762672","volume":"14","author":"A Beck","year":"1973","unstructured":"Beck, A., Warren, P.: The return of the linear search problem. Isr. J. Math. 14(2), 169\u2013183 (1973)","journal-title":"Isr. J. Math."},{"issue":"3","key":"7_CR8","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."},{"issue":"5","key":"7_CR9","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.30.5.1018","volume":"30","author":"AK Chakravarty","year":"1982","unstructured":"Chakravarty, A.K., Orlin, J.B., Rothblum, U.G.: Technical note\u2013a partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment. Oper. Res. 30(5), 1018\u20131022 (1982)","journal-title":"Oper. Res."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-46078-8_14","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Group search on the line. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Search on a line with byzantine robots. In: ISAAC. LIPCS (2016)","DOI":"10.1007\/s00446-017-0296-0"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 405\u2013414. ACM (2016)","DOI":"10.1145\/2933057.2933102"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment. In: FOCS, pp. 298\u2013303. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185382"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-33651-5_5","volume-title":"Distributed Computing","author":"O Feinerman","year":"2012","unstructured":"Feinerman, O., Korman, A.: Memory lower bounds for randomized collaborative search and implications for biology. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 61\u201375. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_5"},{"issue":"3","key":"7_CR15","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoret. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Hanusse, N., Ilcinkas, D., Kosowski, A., Nisse, N.: Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 355\u2013364. ACM (2010)","DOI":"10.1145\/1835698.1835781"},{"issue":"2\u20133","key":"7_CR17","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.tcs.2008.04.034","volume":"402","author":"N Hanusse","year":"2008","unstructured":"Hanusse, N., Kavvadias, D.J., Kranakis, E., Krizanc, D.: Memoryless search algorithms in a network with faulty advice. TCS 402(2\u20133), 190\u2013198 (2008)","journal-title":"TCS"},{"issue":"1","key":"7_CR18","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jagm.1998.0959","volume":"29","author":"M-Y Kao","year":"1998","unstructured":"Kao, M.-Y., Ma, Y., Sipser, M., Yin, Y.: Optimal constructions of hybrid algorithms. J. Algorithms 29(1), 142\u2013164 (1998)","journal-title":"J. Algorithms"},{"issue":"1","key":"7_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M-Y Kao","year":"1996","unstructured":"Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63\u201379 (1996)","journal-title":"Inf. Comput."},{"key":"7_CR20","unstructured":"Kranakis, E., Krizanc, D.: Searching with uncertainty. In: 6th International Colloquium on Structural Information & Communication Complexity, SIROCCO 1999, Lacanau-Ocean, France, 1\u20133 July 1999, pp. 194\u2013203 (1999)"},{"key":"7_CR21","volume-title":"Theory of Optimal Search","author":"L Stone","year":"1975","unstructured":"Stone, L.: Theory of Optimal Search. Academic Press, New York (1975)"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T17:54:27Z","timestamp":1570557267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}