Sciweavers

955 search results - page 137 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 9 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
13 years 5 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
NSDI
2008
15 years 2 days ago
Studying Black Holes in the Internet with Hubble
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
Ethan Katz-Bassett, Harsha V. Madhyastha, John P. ...
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 8 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 2 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt