138 citations · 186 across the 16 of their papers we have counts for
5 papers · 1 filter
Consecutive k-out-of-n:F Systems Have Unbounded Roots
Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi +1
This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are u…
Generalized Convexity Properties and Shape Based Approximation in Networks Reliability
Gabriela Cristescu, Vlad-Florin Dragoi, Sorin-Horatiu Hoara
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating th…
Tight Bounds on the Coeffcients of Consecutive -out-of-: Systems
Vlad-Florin Drăgoi, Simon R. Cowell, Valeriu Beiu
In this paper we compute the coefficients of the reliability polynomial of a consecutive--out-of-: system, in Bernstein basis, using the generalized Pascal coefficients. B…
Cubic spline approximation of the reliability polynomials of two dual hammock networks
Gabriela Cristescu, Vlad-Florin Drăgoi
The property of preserving the convexity and concavity of the Bernstein polynomial and of the Bézier curves is used to generate a method of approximating the reliability polynomial…
Fast Reliability Ranking of Matchstick Minimal Networks
Vlad-Florin Dragoi, Valeriu Beiu
In this article, we take a closer look at the reliability of large minimal networks constructed by repeated compositions of the simplest possible networks. For a given number of de…