Results 231 to 240 of about 2,695,757 (280)
Some of the next articles are maybe not open access.

A closed computer arithmetic

1987 IEEE 8th Symposium on Computer Arithmetic (ARITH), 1987
Two closely related new systems of computer arithmetic are proposed. It is shown that both are closed under arithmetic operations in finite-precision arithmetic, thereby offering a permanent solution to the problems of overflow and underflow. Other advantages of the new systems pertaining to precision are described, and there is also a brief discussion
F W J Olver
exaly   +2 more sources

Standards for computer arithmetic

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
A set of standards for the design of the arithmetic unit of all general purpose digital computers has been proposed. This paper discusses that proposal and suggests that such standards are not now in the best interest of either the computer industry or the computer user.
exaly   +3 more sources

A bibliography on computer arithmetic

1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH), 1975
This bibliography on computer arithmetic uses, by and large, the format and abbreviations employed by Computing Reviews. It is presented in alphabetical order only and not by individual topics. The topics included, however, span the abstract and implementation problems associated with finite precision computer arithmetics.
Bruce D. Shriver, Eric K. Reuter
openaire   +2 more sources

Groupoids and computer arithmetic

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.
Harvey L. Garner, Norman Foo, Lo Hsieh
openaire   +2 more sources

Mathematical Foundation of Computer Arithmetic

IEEE Transactions on Computers, 1975
During recent years a number of papers concerning a mathematical foundation of computer arithmetic have been written. Some of these papers are still unpublished. The papers consider the spaces which occur in numerical computations on computers depending on a properly defined computer arithmetic. The following treatment gives a summary of the main ideas
openaire   +1 more source

On the Use of Residue Arithmetic for Computation

IEEE Transactions on Computers, 1974
Residue arithmetic offers the possibility of "carryfree" arithmetic as far as the operations of addition, subtraction, and multiplication are concerned. It is faster to implement these operations using residue arithmetic as compared to implementation using binary arithmetic.
openaire   +1 more source

Computer Representation and Arithmetic

1995
In Chapter 2, we looked at how numbers can be represented in the binary number system. In this chapter, we shall use the techniques we developed in Chapter 2 to investigate the ways in which numbers are represented and manipulated in binary form in a computer.
openaire   +1 more source

The Parallel Complexity of Arithmetic Computation

1977
Results on the computational complexity of performing several standard types of arithmetic computations in a parallel processing environment are surveyed. The essential equivalence of matrix inversion and the problem of computing the nth power of a matrix in the parallel setting is demonstrated as evidence suggesting an interesting lower bound on the ...
openaire   +2 more sources

A NEW ARITHMETIC FOR SCIENTIFIC COMPUTATION

1983
The paper summarizes an extensive research activity in computer arithmetic and scientific computation that went on during the last fifteen years. We also discuss the experience gained through various implementations of a new approach to arithmetic on diverse processors including microprocessors.
openaire   +2 more sources

Home - About - Disclaimer - Privacy