474 search results - page 84 / 95 » On Multicast Path Finding Algorithms |
INFOCOM
2002
IEEE
14 years 17 days ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...
CCCG
2008
13 years 9 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
KDD
2010
ACM
13 years 6 months ago
2010
ACM
Successful software maintenance is becoming increasingly critical due to the increasing dependence of our society and economy on software systems. One key problem of software main...