The optimal design problem for networks with 3-state components is the following: select from a given class of networks with n components, each of which can he operative or experience an open-mode or a shorted-mode failure state, the network with maximum reliability. We present an algorithm for solving this problem in the case of 2-stage series-parallel networks, i.e., networks consisting of a number of series configurations linked in parallel or vice versa. For practically relevant network sizes (up to 100 components), the algorithm is fast
One of the problems of interest in the field of multi-state network reliability is to found a minima...
The paper tackles the problem of maximizing the reliability of a series system by an opportune choic...
AbstractGiven a network with n vertices and m edges where each edge has an independent operational p...
The optimal design problem for networks with three-state components is the following: select from a ...
A classical problem in computer/network reliability is that of identifying simple, regular and repet...
International audienceReliability optimization is one of the most important steps in industrial syst...
Abstract. Let G (V, E) be a graph whose edges may fail with known probabilities and let K _ V be spe...
This paper reports: 1) parallelization of the two best known sequential algorithms (Dotson & Gobein,...
Fast and efficient communications are essential to the success of large-scale multiprocessor paralle...
AbstractThe paper considers a generalization of the optimal redundancy problem. We consider any mixe...
Abstract. In this paper, the design of a repairable series-parallel system with failure dependencies...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Reliability-based design of structural systems is considered. In particular, systems where the relia...
Which is the most reliable graph with n nodes and m edges? This celebrated problem has several aspec...
International audienceIn order to improve system reliability, designers may introduce in a system di...
One of the problems of interest in the field of multi-state network reliability is to found a minima...
The paper tackles the problem of maximizing the reliability of a series system by an opportune choic...
AbstractGiven a network with n vertices and m edges where each edge has an independent operational p...
The optimal design problem for networks with three-state components is the following: select from a ...
A classical problem in computer/network reliability is that of identifying simple, regular and repet...
International audienceReliability optimization is one of the most important steps in industrial syst...
Abstract. Let G (V, E) be a graph whose edges may fail with known probabilities and let K _ V be spe...
This paper reports: 1) parallelization of the two best known sequential algorithms (Dotson & Gobein,...
Fast and efficient communications are essential to the success of large-scale multiprocessor paralle...
AbstractThe paper considers a generalization of the optimal redundancy problem. We consider any mixe...
Abstract. In this paper, the design of a repairable series-parallel system with failure dependencies...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Reliability-based design of structural systems is considered. In particular, systems where the relia...
Which is the most reliable graph with n nodes and m edges? This celebrated problem has several aspec...
International audienceIn order to improve system reliability, designers may introduce in a system di...
One of the problems of interest in the field of multi-state network reliability is to found a minima...
The paper tackles the problem of maximizing the reliability of a series system by an opportune choic...
AbstractGiven a network with n vertices and m edges where each edge has an independent operational p...