Sciweavers

474 search results - page 15 / 95
» On Multicast Path Finding Algorithms
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 2 months ago
Finding the Fastest Path in Wireless Networks
—The timeliness of packet delivery is an important performance measure in wireless networks, especially when urgent messages need to be transported through a network. This paper ...
Yi Xu, Wenye Wang
AAIM
2008
Springer
105views Algorithms» more  AAIM 2008»
14 years 2 months ago
Finding Optimal Refueling Policies in Transportation Networks
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
Shieu-Hong Lin
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
ECML
2005
Springer
14 years 1 months ago
Mode Directed Path Finding
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
Irene M. Ong, Inês de Castro Dutra, David Pa...
INFOCOM
2007
IEEE
14 years 1 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang