Results 1 to 10 of about 812,236 (286)

Approximate computing of reliability characteristics of some reserved systems

Nauka ta progres transportu, 2012
In work two redundant systems with restored elements are investigated: with a warm sliding reserve, control and preventive maintenance, and a hot sliding reserve. The software for the approached calculation of some characteristics of reliability of these
M.W. Korolewich, N.I. Poslajko
doaj  

The Impact of Profiling Versus Static Analysis in Precision Tuning

IEEE Access
Approximate computing techniques, such as precision tuning, are widely recognized as key enablers for the next generation of computing systems, where computation quality metrics play an important role.
Lev Denisov, Gabriele Magnani, Daniele Cattaneo, Giovanni Agosta, Stefano Cherubin   +4 more
doaj   +1 more source

Novel architecture for floating point accumulator with cancelation error detection [PDF]

Bulletin of the Polish Academy of Sciences: Technical Sciences, 2018
E. Jamro, A. Dąbrowska-Boruch, P. Russek, M. Wielgosz, K. Wiatr   +4 more
doaj   +1 more source

Iterative algorithm for solving mixed quasi-variational-like inequalities with skew-symmetric terms in Banach spaces

Journal of Inequalities and Applications, 2006
We develop an iterative algorithm for computing the approximate solutions of mixed quasi-variational-like inequality problems with skew-symmetric terms in the setting of reflexive Banach spaces.
Ansari Qamrul Hasan, Yao Jen-Chih, Ceng Lu-Chuan   +2 more
doaj  

Approximate Computing for Test and Test of Approximate Computing

Approximate Computing (AxC) is nowadays a well established design and computing paradigm to produce more efficient computation systems by judiciously reducing the computation quality. In particular, AxC has been successfully applied to Integrated Circuits (ICs), in the last years in both ways: AxC for test and the test of AxC integrated circuits.
Barbareschi, Mario, Bosio, Alberto, Girard, Patrick, Deveautour, Bastien, Traiola, Marcello, Virazel, Arnaud   +5 more
openaire   +1 more source

Matrix Padé approximation: Recursive computations

, 1992
The authors consider the computational aspects of the matrix Padé approximants whose definition and properties were described by themselves earlier [Linear Algebra Appl. 137/138, 67-136 (1990; Zbl 0704.41011)]. Two theorems are proved and a recursive method is given for computing the approximants.
Xu, Gl, Bultheel, Adhemar
openaire   +2 more sources

Efficient Inference in First Passage Time Models. [PDF]

Stat Comput
Liu S, Fengler A, Frank MJ, Harrison MT.
europepmc   +1 more source

Area efficient approximate multiplier based on novel 4:2 compressors and error correction logic. [PDF]

Sci Rep
P KP, V NK.
europepmc   +1 more source

Embodying physical computing into soft robots. [PDF]

Nat Commun
Wang J, Zhou Z, Kahak A, Li S.
europepmc   +1 more source

Design of low power and high speed approximate multipliers utilizing current mode 4 to 2 compressors based on CNTFET technology. [PDF]

Sci Rep
Foroutan P, Navi K.
europepmc   +1 more source