QQ客服 官方微博 反馈留言

	A shortest path searching method with area limitation heuristics
	Lu F.
	2006
会议名称	Lecture Notes in Computer Science
页码	884-887
英文摘要	While heuristics based on geometric constructs of the networks would appear to improve performance of Dijkstra's algorithm, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited area heuristics guided by spatial arrangement of networks. The algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable.
收录类别	CPCI
会议录出版者	Springer-Verlag Berlin
语种	英语
ISSN号	0302-9743
ISBN号	3-540-34379-2
内容类型	会议论文
源URL	[http://ir.igsnrr.ac.cn/handle/311030/25215]
专题	地理科学与资源研究所_历年回溯文献
推荐引用方式 GB/T 7714	Lu F.. A shortest path searching method with area limitation heuristics[C]. 见:Lecture Notes in Computer Science.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。