TY - JOUR
T1 - Diagnosis of constant faults in read-once contact networks over finite bases
AU - Busbait, Monther I.
AU - Chikalov, Igor
AU - Hussain, Shahid
AU - Moshkov, Mikhail
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authors wish to express their gratitude to anonymous reviewers for useful comments and suggestions.
PY - 2015/3
Y1 - 2015/3
N2 - We study the depth of decision trees for diagnosis of constant 0 and 1 faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in the networks. For bases containing networks with at most 10 edges we find coefficients for linear bounds which are close to sharp. © 2014 Elsevier B.V. All rights reserved.
AB - We study the depth of decision trees for diagnosis of constant 0 and 1 faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in the networks. For bases containing networks with at most 10 edges we find coefficients for linear bounds which are close to sharp. © 2014 Elsevier B.V. All rights reserved.
UR - http://hdl.handle.net/10754/564091
UR - https://linkinghub.elsevier.com/retrieve/pii/S0166218X1400479X
UR - http://www.scopus.com/inward/record.url?scp=84930599229&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2014.10.034
DO - 10.1016/j.dam.2014.10.034
M3 - Article
SN - 0166-218X
VL - 184
SP - 76
EP - 88
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -