854 search results - page 70 / 171 » Abstracting from Failure Probabilities |
130
click to vote
ISSTA
2004
ACM
15 years 10 months ago
2004
ACM
—Many modern software systems are designed to be highly configurable so they can run on and be optimized for a wide variety of platforms and usage scenarios. Testing such systems...
113
click to vote
ICECCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Messaging services are a useful component in distributed systems that require scalable dissemination of messages (events) from suppliers to consumers. These services decouple supp...
125
click to vote
JSAC
2007
15 years 4 months ago
2007
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
155
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
119
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...