Sciweavers

24554 search results - page 4869 / 4911
» Dependable distributed systems
Sort
View
IMC
2007
ACM
13 years 11 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
IMC
2007
ACM
13 years 11 months ago
Compressed network monitoring for ip and all-optical networks
We address the problem of efficient end-to-end network monitoring of path metrics in communication networks. Our goal is to minimize the number of measurements or monitors requir...
Mark Coates, Yvan Pointurier, Michael Rabbat
IMC
2007
ACM
13 years 11 months ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 11 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
DAGSTUHL
2007
13 years 11 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
« Prev « First page 4869 / 4911 Last » Next »