Diagnosis of constant faults in read-once contact networks over finite bases

Handle URI:
http://hdl.handle.net/10754/564091
Title:
Diagnosis of constant faults in read-once contact networks over finite bases
Authors:
Busbait, Monther I.; Chikalov, Igor; Hussain, Shahid ( 0000-0002-1698-2809 ) ; Moshkov, Mikhail ( 0000-0003-0085-9483 )
Abstract:
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.
KAUST Department:
Computer, 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
Publisher:
Elsevier BV
Journal:
Discrete Applied Mathematics
Issue Date:
Mar-2015
DOI:
10.1016/j.dam.2014.10.034
Type:
Article
ISSN:
0166218X
Sponsors:
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.
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorBusbait, Monther I.en
dc.contributor.authorChikalov, Igoren
dc.contributor.authorHussain, Shahiden
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2015-08-03T12:31:43Zen
dc.date.available2015-08-03T12:31:43Zen
dc.date.issued2015-03en
dc.identifier.issn0166218Xen
dc.identifier.doi10.1016/j.dam.2014.10.034en
dc.identifier.urihttp://hdl.handle.net/10754/564091en
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.en
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.en
dc.publisherElsevier BVen
dc.subjectConstant faultsen
dc.subjectDecision treesen
dc.subjectRead-once contact networksen
dc.titleDiagnosis of constant faults in read-once contact networks over finite basesen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalDiscrete Applied Mathematicsen
kaust.authorChikalov, Igoren
kaust.authorHussain, Shahiden
kaust.authorMoshkov, Mikhailen
kaust.authorBusbait, Monther I.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.