Sciweavers

1127 search results - page 68 / 226
» New Algorithms for Generalized Network Flows
Sort
View
AINA
2007
IEEE
15 years 4 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
79
Voted
CN
1999
114views more  CN 1999»
14 years 10 months ago
An Improved Topology Discovery Algorithm for Networks with Wormhole Routing and Directed Links
We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was develop...
Ying-Yi Huang, Mart L. Molle
INFOCOM
2009
IEEE
15 years 4 months ago
Cross-Layer Survivability in WDM-Based Networks
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...
Kyunghan Lee, Eytan Modiano
ICDCS
2008
IEEE
15 years 4 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
APIN
2004
107views more  APIN 2004»
14 years 10 months ago
Designing Polymer Blends Using Neural Networks, Genetic Algorithms, and Markov Chains
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
N. K. Roy, Walter D. Potter, D. P. Landau