474 search results - page 30 / 95 » On Multicast Path Finding Algorithms |
SODA
1990
ACM
15 years 28 days ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
EPEW
2008
Springer
15 years 1 months ago
2008
Springer
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
188
click to vote
ICDCS
2012
IEEE
13 years 2 months ago
2012
IEEE
Abstract—In this paper we have proposed and designed FindingHuMo (Finding Human Motion), a real-time user tracking system for Smart Environments. FindingHuMo can perform device-f...
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...