Diagnosis of constant faults in read-once contact networks over finite bases
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Applied Mathematics and Computational Science Program
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Computer Science Program
Permanent link to this recordhttp://hdl.handle.net/10754/564091
MetadataShow full item record
AbstractWe 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.
SponsorsResearch 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.
JournalDiscrete Applied Mathematics