Sciweavers

2862 search results - page 58 / 573
» Bicriteria Network Design Problems
Sort
View
ENTCS
2007
145views more  ENTCS 2007»
14 years 9 months ago
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks
Wireless sensor networks are comprised of a vast number of ultra-small autonomous computing, communication and sensing devices, with restricted energy and computing capabilities, ...
Ioannis Chatzigiannakis, Elisavet Konstantinou, Va...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
15 years 4 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 3 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
WWW
2003
ACM
15 years 10 months ago
A Multicast-On-Large-Demand Approach to the Flash Crowd Problem
In this paper we propose a multicast-on-large-demand (MOLD) approach to the flash crowd problem. A MOLD Web server may dynamically open a multicast channel for resources when dete...
Rocky K. C. Chang
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 1 months ago
A Fresh Look at PRE as a Maximum Flow Problem
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
Jingling Xue, Jens Knoop