Jan 16, 2017 · This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing ...

This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing in the nanoscales.

Two schemes that utilize in different manners approximate voting, are proposed. The first scheme is referred to as inexact double modular redundancy (IDMR).

Two schemes that utilize in different manners approximate voting, are proposed. The first scheme is referred to as inexact double modular redundancy (IDMR).

Abstract: This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing.

Abstract— This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing.

Abstract— This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing.

Oct 11, 2018 · Two schemes that utilize in several manners approximate voting, are proposed. The first theme is known as inexact double modular redundancy ( ...

This work presents a study on the reliability of voters for approximate fault tolerant systems in the context of single event effects and electromagnetic ...

Two Approximate Voting Schemes for Reliable Computing. Release time:2021-04-01 / Hits:89. Journal:IEEE Transactions on Computers. Indexed by:Journal paper.