Sciweavers

1245 search results - page 113 / 249
» Topology generation based on network design heuristics
Sort
View
BMCBI
2008
138views more  BMCBI 2008»
15 years 6 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 12 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
PPSN
2010
Springer
15 years 4 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
SIGADA
2001
Springer
15 years 10 months ago
Targeting Ada95/DSA for distributed simulation of multiprotocol communication networks
The last years have seen an increasing, albeit restricted simulation of large-scale networks on shared memory parallel platforms. As the complexity of communication protocols and ...
Dhavy Gantsou
AINA
2008
IEEE
15 years 8 months ago
A Communication-Efficient Distributed Clustering Algorithm for Sensor Networks
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as a core task of mining sensor data plays an essential role in analytical application...
Amirhosein Taherkordi, Reza Mohammadi, Frank Elias...