Sciweavers

117 search results - page 18 / 24
» Hybrid constructive heuristics for the critical node problem
Sort
View
INFOCOM
1997
IEEE
15 years 2 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
AINA
2004
IEEE
15 years 2 months ago
A Vision on Semantic Retrieval in P2P Network
P2P systems are a revival paradigm for information sharing among distributed nodes in the network. Currently, many research projects or practical applications have emerged from th...
Hao Ding, Ingeborg Sølvberg, Yun Lin
INFOCOM
2006
IEEE
15 years 4 months ago
Capacity-Constrained Design of Resilient Multi-Tier Wireless Mesh Networks
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
R. Raghuraman, Sridhar Iyer
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 7 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
CLUSTER
2008
IEEE
15 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman