8780 search results - page 299 / 1756 » On the Feasibility of Consistent Computations |
203
click to vote
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
Network intrusion detection systems typically detect worms by examining packet or flow logs for known signatures. Not only does this approach mean worms cannot be detected until ...
222
click to vote
CONEXT
2008
ACM
15 years 9 months ago
2008
ACM
Enterprise networks are important, with size and complexity even surpassing carrier networks. Yet, the design of enterprise networks remains ad-hoc and poorly understood. In this p...
209
click to vote
DAGSTUHL
2004
15 years 9 months ago
2004
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
189
Voted
NETWORKING
2004
15 years 8 months ago
2004
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. Since exact probabilistic diagnosis is known to be an NP-hard problem, a...
203
Voted
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...