Results 71 to 80 of about 104 (87)
Some of the next articles are maybe not open access.
The pessimistic diagnosability of alternating group graphs under the PMC model
Information Processing Letters, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang-Hsiung Tsai
exaly +3 more sources
International Journal of Computer Mathematics: Computer Systems Theory, 2019
In a simple graph G=(V(G),E(G)), let n0 be the minimum cardinality of the neighbourhoods of any two adjacent vertices, i.e. n0=min{|NG({u,v})||(u,v)∈E(G)}.
Dongqin Cheng
exaly +2 more sources
In a simple graph G=(V(G),E(G)), let n0 be the minimum cardinality of the neighbourhoods of any two adjacent vertices, i.e. n0=min{|NG({u,v})||(u,v)∈E(G)}.
Dongqin Cheng
exaly +2 more sources
A note on “Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy”
Computer Architecture News, 1993We point out an unconsidered case in the proof for Theorem 3 in [4] and provide the proof for that case. To this end, a new property of n -hypercube is observed and made use of.
Dajin Wang
exaly +2 more sources
A Note on the Pessimistic Diagnosability of Augmented Cubes
Journal of Interconnection Networks, 2016A system is t/t-diagnosable if, provided the number of faulty processor is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free node mistake as a faulty one. The pessimistic diagnosability of a system G, denoted by tp(G), is the maximal number of faulty processors so that the system G is t/t ...
Rong-Xia Hao +3 more
openaire +1 more source
Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy
IEEE Transactions on Computers, 1991The capabilities of a system-diagnosis technique based on mutual testing are discussed. The technique is applied to hypercube computer systems. A one-step diagnosis of hypercubes that involves only one testing phase, in which processors test each other, is described.
Alireza Kavianpour, K. H. Kim
openaire +1 more source
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes
International Journal of Computer Mathematics: Computer Systems Theory, 2016ABSTRACTA system is t/t-diagnosable if, provided the number of faulty processors is bounded by t, all faulty processors can be isolated within a set of size at most t with at most one fault-free processor mistaken as a faulty one. The pessimistic diagnosability of a system G, denoted by , is the maximal number of faulty processors so that the system G ...
Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng
openaire +1 more source
Comparative analysis of related notions of robust diagnosability of Discrete-Event Systems
Annual Reviews in Control, 2021Lilian K Carvalho +2 more
exaly
The diagnosability of thek-aryn-cubes using the pessimistic strategy
International Journal of Computer Mathematics, 2012Qiang Zhu
exaly
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes
International Journal of Computer Mathematics: Computer Systems Theory, 2016Mei-Mei Gu +2 more
exaly
Fault diagnosability of DQcube under the PMC model
Discrete Applied Mathematics, 2019Shuming Zhou, Jiafei Liu, Xueli Sun
exaly