184 search results - page 5 / 37 » Communication in Networks with Random Dependent Faults |
102
click to vote
TSP
2010
14 years 4 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
110
click to vote
PODC
2012
ACM
13 years 1 days ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
CCR
2006
14 years 9 months ago
2006
Effective network troubleshooting is critical for maintaining efficient and reliable network operation. Troubleshooting is especially challenging in multi-hop wireless networks be...
81
Voted
FLAIRS
2007
14 years 12 months ago
2007
In this paper we shall introduce an approach that forms a basis for temporal data mining. A relation algebra is applied for the purpose of representing simultaneously dependencies...