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

Handle URI:
http://hdl.handle.net/10754/603716
Title:
Diagnosis of three types of constant faults in read-once contact networks over finite bases
Authors:
Busbait, Monther I.; Moshkov, Mikhail ( 0000-0003-0085-9483 )
Abstract:
We study the depth of decision trees for diagnosis of three types of constant faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis and each type of faults, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in networks. For bases containing networks with at most 10 edges, we find sharp coefficients for linear bounds.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Diagnosis of three types of constant faults in read-once contact networks over finite bases 2016 Theoretical Computer Science
Publisher:
Elsevier BV
Journal:
Theoretical Computer Science
Issue Date:
24-Mar-2016
DOI:
10.1016/j.tcs.2016.03.023
Type:
Article
ISSN:
03043975
Sponsors:
Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authors are greatly indebted to reviewers for useful comments.
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S0304397516002346
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorBusbait, Monther I.en
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2016-03-27T12:31:15Zen
dc.date.available2016-03-27T12:31:15Zen
dc.date.issued2016-03-24en
dc.identifier.citationDiagnosis of three types of constant faults in read-once contact networks over finite bases 2016 Theoretical Computer Scienceen
dc.identifier.issn03043975en
dc.identifier.doi10.1016/j.tcs.2016.03.023en
dc.identifier.urihttp://hdl.handle.net/10754/603716en
dc.description.abstractWe study the depth of decision trees for diagnosis of three types of constant faults in read-once contact networks over finite bases containing only indecomposable networks. For each basis and each type of faults, we obtain a linear upper bound on the minimum depth of decision trees depending on the number of edges in networks. For bases containing networks with at most 10 edges, we find sharp coefficients for linear bounds.en
dc.description.sponsorshipResearch reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authors are greatly indebted to reviewers for useful comments.en
dc.language.isoenen
dc.publisherElsevier BVen
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0304397516002346en
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 24 March 2016. DOI: 10.1016/j.tcs.2016.03.023en
dc.subjectRead-once contact networksen
dc.subjectConstant faultsen
dc.subjectDecision treesen
dc.titleDiagnosis of three types 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.identifier.journalTheoretical Computer Scienceen
dc.eprint.versionPost-printen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorBusbait, Monther I.en
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.