Sciweavers

4781 search results - page 378 / 957
» Online algorithms for network design
Sort
View
CACM
2008
84views more  CACM 2008»
15 years 7 months ago
The emergence of a networking primitive in wireless sensor networks
The wireless sensor network community approached netabstractions as an open question, allowing answers to emerge with time and experience. The Trickle algorithm has become a basic...
Philip Levis, Eric A. Brewer, David E. Culler, Dav...
LATIN
2010
Springer
16 years 21 days ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
16 years 4 months ago
Branch Merge Reduction of RLCM Networks
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
Bernard N. Sheehan
RSA
2010
98views more  RSA 2010»
15 years 6 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
INFOCOM
2007
IEEE
16 years 1 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...