Show simple item record

dc.contributor.authorBusbait, Monther I.
dc.contributor.authorChikalov, Igor
dc.contributor.authorHussain, Shahid
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2015-08-03T12:31:43Z
dc.date.available2015-08-03T12:31:43Z
dc.date.issued2015-03
dc.identifier.issn0166218X
dc.identifier.doi10.1016/j.dam.2014.10.034
dc.identifier.urihttp://hdl.handle.net/10754/564091
dc.description.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.
dc.description.sponsorshipResearch 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.
dc.publisherElsevier BV
dc.subjectConstant faults
dc.subjectDecision trees
dc.subjectRead-once contact networks
dc.titleDiagnosis of constant faults in read-once contact networks over finite bases
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.contributor.departmentComputer Science Program
dc.identifier.journalDiscrete Applied Mathematics
kaust.personChikalov, Igor
kaust.personHussain, Shahid
kaust.personMoshkov, Mikhail
kaust.personBusbait, Monther I.


This item appears in the following Collection(s)

Show simple item record