Results 251 to 260 of about 395,539 (297)
Some of the next articles are maybe not open access.
1994
Having introduced a timing formalism, TBF’s, we now apply it to the problem of computing the exact delays oe digital circuits.For a combinational circuit, we are interested in knouing hou long the cirult takes to comoute its outpurs from its inputs,or the delay of the circuit.the delay of a circuit given an inpue is the earliest time the circuie’s ...
William K. C. Lam, Robert K. Brayton
openaire +1 more source
Having introduced a timing formalism, TBF’s, we now apply it to the problem of computing the exact delays oe digital circuits.For a combinational circuit, we are interested in knouing hou long the cirult takes to comoute its outpurs from its inputs,or the delay of the circuit.the delay of a circuit given an inpue is the earliest time the circuie’s ...
William K. C. Lam, Robert K. Brayton
openaire +1 more source
Faster Exact Reliability Computation
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W), 2017High reliability guarantees are a prerequisite for any critical infrastructure. In complex systems, the computation of the probability to provide a service is difficult and hence time consuming. To this end, this article presents an improved method for exact reliability computation by exploiting the existence of articulation points in graphs ...
Vincent Debieux +2 more
openaire +1 more source
2005
Exact computation sequences are sequences of the form $$ \mathop - \limits^{S_1 } > \mathop - \limits^{S_2 } > ...\mathop - \limits^{S_n } > ,$$ , where L0 is a free algebra, A0 is a set of conditional equations over L0, Si is a "step function", L i =S i (L i −1), and A i =S i (A i −1). Each step function is the top-down reduction extension
Alex Pelin, Jean H. Gallier
openaire +1 more source
Exact computation sequences are sequences of the form $$ \mathop - \limits^{S_1 } > \mathop - \limits^{S_2 } > ...\mathop - \limits^{S_n } > ,$$ , where L0 is a free algebra, A0 is a set of conditional equations over L0, Si is a "step function", L i =S i (L i −1), and A i =S i (A i −1). Each step function is the top-down reduction extension
Alex Pelin, Jean H. Gallier
openaire +1 more source
Exact Constructive and Computable Dimensions
Theory of Computing Systems, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Exact Real Computation in Computer Algebra
2003Exact real computation allows many of the advantages of numerical computation (e.g. high performance) to be accessed also in symbolic computation, providing validated results. In this paper we present our approach to build a transparent and easy to use connection between the two worlds, using this paradigm. The main discussed topics are: representation
Gábor Bodnár +3 more
openaire +1 more source
Computability versus exact computability of martingales
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Exact computations for the coherence estimate
Medical & Biological Engineering & Computing, 2007The recent paper by Miranda de Sa et al. [10] developed methods for computing the sampling distribution of the coherence estimate between two signals. However, the methods were based on some approximations because it was claimed that exact calculations required extensive computations. In this technical note, we provide analytical expressions and 1-line
Saralees, Nadarajah, Samuel, Kotz
openaire +2 more sources
Exact computer realization of certain computational algorithms
Journal of Soviet Mathematics, 1980The question of organizing calculations in supermany-valued arithmetic on a computer is examined. A program is presented for a model computer based on a computer of type M-20, permitting the exact solution of a system of a system of linear algebraic equations to be obtained by the Gauss-Jordan method.
Aleksandrova, A. A., Smirnova, T. N.
openaire +2 more sources
Exact computation of spherical harmonics
Computing, 1984Essential results of the theory of spherical harmonics are recapitulated by intrinsic properties of the space of homogeneous harmonic polynomials of degreen and dimensionq. The theoretical considerations are used to describe an alternate method to the conventional procedure of constructing spherical harmonics by recursion.
Freeden, W., Reuter, R.
openaire +1 more source
Exact power computation for dose—response studies
Statistics in Medicine, 1995AbstractThe toxicity of an agent or the therapeutic effect of a drug may be assessed by a dose‐response study. We present a method for computing the exact power of exact and large sample statistical tests employed for binary response data from such a study.
M L, Tang, K F, Hirji, S E, Vollset
openaire +2 more sources