卧虎藏龙 发表于 2025-3-26 23:10:42
http://reply.papertrans.cn/103/10218/1021705/1021705_31.pngdefibrillator 发表于 2025-3-27 03:37:53
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface-based algorithms are proposed, namely, Naïve algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global虚情假意 发表于 2025-3-27 08:59:18
http://reply.papertrans.cn/103/10218/1021705/1021705_33.pngmeditation 发表于 2025-3-27 13:10:07
http://reply.papertrans.cn/103/10218/1021705/1021705_34.png唤起 发表于 2025-3-27 14:22:03
Mobile SeoulSearch: A Web-Based Mobile Regional Information Retrieval System Utilizing Location Infonformation is displayed efficiently in spite of very poor user interface in mobile devices. Finally, methods for gathering Web pages and indexing regional terms, are proposed to provide mobile users with the regional information effectively. The efficiency of these methods are verified through the d减震 发表于 2025-3-27 19:13:15
http://reply.papertrans.cn/103/10218/1021705/1021705_36.pngMammal 发表于 2025-3-28 00:00:37
Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Networkmessages. Experiments show that the number of forwarded messages is reduced in an order of magnitude with our . method compared to LAR-like method. At best, our method reduces about 57 times less messages.江湖郎中 发表于 2025-3-28 02:49:24
http://reply.papertrans.cn/103/10218/1021705/1021705_38.png入伍仪式 发表于 2025-3-28 08:31:26
http://reply.papertrans.cn/103/10218/1021705/1021705_39.png投票 发表于 2025-3-28 13:57:19
http://reply.papertrans.cn/103/10218/1021705/1021705_40.png