854 search results - page 6 / 171 » Abstracting from Failure Probabilities |
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
—we study dynamic routing and wavelength assignment scheme when there are any available wavelengths on a route in the wavelength-routed networks. An optical wavelength path reque...
83
Voted
SAC
2006
ACM
15 years 3 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
78
Voted
FSEN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
79
Voted
JSAC
2006
14 years 9 months ago
2006
As networks grow in size and complexity, both the probability and the impact of failures increase. The pre-allocated backup bandwidth, which has been widely investigated in the lit...
TPDS
2010
14 years 7 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...