Results 231 to 240 of about 376,245 (265)
Reliability: Reliability of improved network [PDF]
, 2008 One of the problems of interest in the field of multi-state network reliability is to found a minimal number of components that should be improved, in order to obtain a network with higher level of work. The main purpose in this paper is how to find the minimal number of components that should be exchanged, so that we will have system that works is a ...
Mihova, Marija +2 more
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A recovery algorithm for reliable multicasting in reliable networks
2003 International Conference on Parallel Processing, 2003. Proceedings., 2003Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clients), hierarchically and/or geographically and/or randomly organized. Recovery requests are sent to the recovery clients on the list one-by-one until the recovery effort is ...
Danyang Zhang +3 more
openaire +1 more source
Polyhedral Combinatorics and Network Reliability
Mathematics of Operations Research, 1986This paper studies the reliability of systems comprised of variables which must satisfy a set of linear equalities and nonnegativity constraints, and which are subject to random failure. A major example, which will be given special emphasis, is the reachability (source-to-all connectedness reliability) problem for stochastic networks.
openaire +2 more sources
Highly reliable stochastic flow network reliability estimation
2016 XLII Latin American Computing Conference (CLEI), 2016This state of the art discusses the problem of reliability estimation for highly reliable stochastic flow networks. There are algorithms to compute this reliability exactly, but they have exponential complexity, making the problem intractable for large or even medium sized networks.
Héctor Cancela 0001 +2 more
openaire +2 more sources
A reliability‐improving graph transformation with applications to network reliability
Networks, 1992AbstractThis paper considers a probabilistic graph in which the points are perfectly reliable but the edges operate independently of one another, all with some known probability p. The graph G is in an operating state if the surviving edges induce a spanning connected subgraph of G.
Appajosyula Satyanarayana +2 more
openaire +1 more source
Sixty Years of Network Reliability
Mathematics in Computer Science, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2016
In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in
openaire +1 more source
In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions. The present text is aimed at providing modelling and analysis techniques for the evaluation of reliability measures (2-terminal, all-terminal, k-terminal reliability) for systems whose structure can be described in
openaire +1 more source
Network reliability analysis: matrix-exponential approach
Reliability Engineering and System Safety, 2021Yusuf Bilfaqih +2 more
exaly