Sciweavers

478 search results - page 43 / 96
» Diameter and Center Computations in Networks
Sort
View
SIROCCO
2008
15 years 1 months ago
Locating and Repairing Faults in a Network with Mobile Agents
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
Colin Cooper, Ralf Klasing, Tomasz Radzik
PC
2000
96views Management» more  PC 2000»
14 years 11 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu
BMCBI
2007
202views more  BMCBI 2007»
14 years 12 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
SPAA
2006
ACM
15 years 5 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
OR
2007
Springer
14 years 11 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...