{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:55:06Z","timestamp":1759683306950,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,22]]},"DOI":"10.1145\/1739041.1739084","type":"proceedings-article","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T19:27:05Z","timestamp":1268767625000},"page":"347-358","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":96,"title":["Probabilistic path queries in road networks"],"prefix":"10.1145","author":[{"given":"Ming","family":"Hua","sequence":"first","affiliation":[{"name":"Facebook Inc., Palo Alto, CA"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, BC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/800105.803393"},{"key":"e_1_3_2_1_2_1","volume-title":"C. Demetrescu et al. (editors","author":"Bast H.","year":"2006","unstructured":"H. Bast Transit: Ultrafast shortest-path queries with linear-time preprocessing . In C. Demetrescu et al. (editors ). 9th DIMACS Implementation Challenge --- Shortest Path , 2006 . H. Bast et al. Transit: Ultrafast shortest-path queries with linear-time preprocessing. In C. Demetrescu et al. (editors). 9th DIMACS Implementation Challenge --- Shortest Path, 2006."},{"unstructured":"H. Bast etal In transit to constant time shortest-path queries in road networks. In ALENEX'07.  H. Bast et al . In transit to constant time shortest-path queries in road networks. In ALENEX'07 .","key":"e_1_3_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1321440.1321494"},{"unstructured":"A. Chang and E. Amir. Reachability under uncertainty. In UAI'07.  A. Chang and E. Amir. Reachability under uncertainty. In UAI'07 .","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/s10957-005-7498-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/j.camwa.2004.07.028"},{"key":"e_1_3_2_1_8_1","volume-title":"Optimal Routing for Maximizing the Travel Time Reliability. Networks and Spatial Economics, 6(3--4):333--344","author":"Fan Y.","year":"2006","unstructured":"Y. Fan and Y. Nie . Optimal Routing for Maximizing the Travel Time Reliability. Networks and Spatial Economics, 6(3--4):333--344 , 2006 . Y. Fan and Y. Nie. Optimal Routing for Maximizing the Travel Time Reliability. Networks and Spatial Economics, 6(3--4):333--344, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1287\/opre.17.4.583"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.cor.2005.03.027"},{"volume-title":"INFOCOM'07","author":"Ghosh J.","unstructured":"J. Ghosh On a routing problem within probabilistic graphs and its application to intermittently connected networks . In INFOCOM'07 . J. Ghosh et al. On a routing problem within probabilistic graphs and its application to intermittently connected networks. In INFOCOM'07.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","volume-title":"Sensor validation and fusion for automated vehicle control using fuzzy techniques. Journal of Dynamic Systems, Measurement, and Control, 123(1):145--146","author":"Goebel K.","year":"2001","unstructured":"K. Goebel and A. M. Agogino . Sensor validation and fusion for automated vehicle control using fuzzy techniques. Journal of Dynamic Systems, Measurement, and Control, 123(1):145--146 , 2001 . K. Goebel and A. M. Agogino. Sensor validation and fusion for automated vehicle control using fuzzy techniques. Journal of Dynamic Systems, Measurement, and Control, 123(1):145--146, 2001."},{"unstructured":"H. Gonzalez etal Adaptive fastest path computation on a road network: a traffic mining approach. In VLDB'07.   H. Gonzalez et al . Adaptive fastest path computation on a road network: a traffic mining approach. In VLDB'07 .","key":"e_1_3_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1006\/jcss.1995.1076"},{"issue":"2","key":"e_1_3_2_1_15_1","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics","volume":"4","author":"Hart P.","year":"1968","unstructured":"P. Hart A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics , IEEE Transactions on , 4 ( 2 ): 100 -- 107 , July 1968 . P. Hart et al. A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on, 4(2):100--107, July 1968.","journal-title":"IEEE Transactions on"},{"volume-title":"Temporal and Spatial Variability of Travel Time","author":"He R. R.","unstructured":"R. R. He Temporal and Spatial Variability of Travel Time . Center for Traffic Simulation Studies . Paper UCI-ITS-TS-02-14. R. R. He et al. Temporal and Spatial Variability of Travel Time. Center for Traffic Simulation Studies. Paper UCI-ITS-TS-02-14.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/69.687976"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1137\/S0363012999361093"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/358172.358406"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/11841036_50"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/BF00167196"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1023\/B:JOTH.0000013560.69722.c1"},{"key":"e_1_3_2_1_24_1","volume-title":"Stochastic Orders and Their Applications","author":"Righter R.","year":"1994","unstructured":"R. Righter . Scheduling . In Stochastic Orders and Their Applications , 1994 . R. Righter. Scheduling. In Stochastic Orders and Their Applications, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1376616.1376623"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/11561071_51"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/11841036_71"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/TKDE.2006.48"},{"key":"e_1_3_2_1_29_1","first-page":"1511","volume-title":"Intelligent Transportation Systems","author":"Wu Y.","year":"2003","unstructured":"Y. Wu A shortest path algorithm based on hierarchical graph model . In Intelligent Transportation Systems , pages 1511 -- 1514 , 2003 . Y. Wu et al. A shortest path algorithm based on hierarchical graph model. In Intelligent Transportation Systems, pages 1511--1514, 2003."}],"event":{"acronym":"EDBT\/ICDT '10","name":"EDBT\/ICDT '10: EDBT\/ICDT '10 joint conference","location":"Lausanne Switzerland"},"container-title":["Proceedings of the 13th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1739041.1739084","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1739041.1739084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:40Z","timestamp":1750249420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1739041.1739084"}},"subtitle":["traffic uncertainty aware path selection"],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":29,"alternative-id":["10.1145\/1739041.1739084","10.1145\/1739041"],"URL":"https:\/\/doi.org\/10.1145\/1739041.1739084","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}