Results 211 to 220 of about 24,617 (263)
Aerodynamic Optimization of Relay Nozzle Using a Chebyshev KAN Surrogate Model Integration and an Improved Multi-Objective Red-Billed Blue Magpie Optimizer. [PDF]
Biomimetics (Basel)Shen M +5 more
europepmc +1 more source
Research on Error Compensation Methods of Dynamic Gravity Measurement Based on Swarm Cooperation Evolution Strategy and Optimized LSTM. [PDF]
Entropy (Basel)Li X +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Set System Polynomial with Colouring and Reliability Applications
SIAM Journal on Discrete Mathematics, 1988Summary: In order to relate the chromatic and all-terminal reliability polynomials, a simple two-variable polynomial is introduced. The latter polynomial is defined on a set system; as a result, many similarities between the chromatic and all-teminal reliability polynomials can be derived.
Jason Brown
exaly +3 more sources
Roots of two‐terminal reliability polynomials
Networks, 2020AbstractAssume that the vertices of a graph G are always operational, but the edges of G are operational independently with probability p ∈ [0, 1]. For fixed vertices s and t, the two‐terminal reliability of G is the probability that the operational subgraph contains an (s, t)‐path, while the all‐terminal reliability of G is the probability that the ...
Jason I. Brown, Corey D. C. DeGagné
openaire +2 more sources
Roots of the Reliability Polynomials
SIAM Journal on Discrete Mathematics, 1992The reliability of a graph \(G\) is the probability that \(G\) is connected, given that edges are independently operational with probability \(p\). This is known to be a polynomial in \(p\), and the location of the roots of these functions is discussed. In particular, it is conjectured that the roots of the reliability polynomial of any connected graph
Jason I. Brown, Charles J. Colbourn
openaire +1 more source
On an Invariant of Graphs and the Reliability Polynomial
SIAM Journal on Algebraic Discrete Methods, 1986A combinatorial invariant called the parity of a graph is introduced. An earlier concept of signed domination of a graph, relevant to computing certain reliability measures on an undirected graph, is a special case of this parity. A generalization of the signed domination theorem is presented.
Satyanarayana, A., Khalil, Zohel
openaire +1 more source
Reliability polynomial for a ring network
IEEE Transactions on Communications, 1993A mathematical model is developed for the reliability of a system made up of m unreliable nodes arranged in a ring. The model can be used to calculate the reliability of single-ring networks in which the network recovery mechanism depends on bypassing failed stations, but link signal power margins are inadequate to overcome losses due to more than n ...
Dotson, William +2 more
openaire +2 more sources
Numerically reliable computation of characteristic polynomials
Proceedings of 1995 American Control Conference - ACC'95, 2005Presents an algorithm for computing the characteristic polynomial of the pencil (A-sE). It is shown that after a preliminary reduction of the matrices A and E to, respectively, an upper Hessenberg and an upper triangular matrix, the problem of computing the characteristic polynomial is transformed to the solution of certain triangular systems of linear
Misra, Pradeep +2 more
openaire +2 more sources
On the roots of strongly connected reliability polynomials
Networks, 2009AbstractThe strongly connected reliability scRel(D, p) of a digraph D is the probability that the spanning subgraph of D consisting of the operational arcs is strongly connected, given that the vertices always operate, but each arc independently operates with probability p ∈ [0, 1].
Jason I. Brown, Karl Dilcher
openaire +2 more sources