173 search results - page 34 / 35 » Bounds and Heuristics for the Shortest Capacitated Paths Pro... |
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
WEA
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...