International Journal of Computer Science and Informatics
Abstract
Referending algorithms are used to adjudicate among the consequences of surplus modules in miscue-remedial systems. Not exactly, popular allies entail a request-precise ’Disciple Point’ value to be précised, whereas biased standard allies are incapable to generate a compassionate productivity while refusal concurrence exists between the allies inputs. The disciple is tentatively appraised from the summit of vision security and accessibility, and contrast with the imperfect popular disciple in a Triple Modular Redundancy prearranged outline. We show that the Velour disciple gives extra exact outputs (advanced accessibility) than the wrong popular disciple with petite and hefty slip-ups, fewer false outputs (superior security) than the imperfect popular disciple in the occurrence of tiny slip-ups, and a smaller amount kind outputs than the inaccurate popular choose. The proportion of the kind outputs of the bulk disciples that are fruitfully hold by the Velour fanatic (ensuing in accurate outputs) is more than the proportion of those that are disastrously determined by the Velour fanatic (ensuing in erroneous outputs).
Recommended Citation
PRASAD, B.V.V.S.; BALAJI, V.; and RAO, M.MADHAVA
(2013)
"A VELOUR PLEBISCITE TRACING FOR HARDWARE AND SOFTWARE MISCUE REMEDIAL SYSTEMS,"
International Journal of Computer Science and Informatics: Vol. 3:
Iss.
2, Article 8.
DOI: 10.47893/IJCSI.2013.1128
Available at:
https://www.interscience.in/ijcsi/vol3/iss2/8
DOI
10.47893/IJCSI.2013.1128
Included in
Computer Engineering Commons, Information Security Commons, Systems and Communications Commons
