Results 231 to 240 of about 51,397 (286)
Some of the next articles are maybe not open access.

Unlocking approximation for in-memory computing with Cartesian genetic programming and computer algebra for arithmetic circuits

it - Information Technology, 2022
With ReRAM being a non-volative memory technology, which features low power consumption, high scalability and allows for in-memory computing, it is a promising candidate for future computer architectures. Approximate computing is a design paradigm, which
Saman Froehlich, R. Drechsler
semanticscholar   +1 more source

Combining Symbolic Computer Algebra and Boolean Satisfiability for Automatic Debugging and Fixing of Complex Multipliers

IEEE Computer Society Annual Symposium on VLSI, 2018
If verification of a digital circuit fails, then debugging and fixing become the major subsequent tasks. Arithmetic units are among the most challenging circuits for debugging because of a wide variety of architectures and high design complexity.
Alireza Mahzoon   +2 more
semanticscholar   +1 more source

Fixed Polarity Pascal Transforms with Symbolic Computer Algebra Applications

Pacific Rim Conference on Communications, Computers and Signal Processing, 2019
The fixed polarity forms of the Reed-Muller (RM) transform exist in 2n different polarities. The integer-valued Pascal transform is related to the binary-valued RM transform through the Sierpinski fractal, calculated by performing the modulo-2 operation ...
Kaitlin N. Smith, M. Thornton
semanticscholar   +1 more source

Symbolic and algebraic computation research in Italy

ACM SIGSAM Bulletin, 1987
We like to fix the starting point of the research activities in Symbolic and Algebraic Computation (SAC) in Italy at the IFIP Working Conference on Symbol Manipulation Languages and Techniques held in Pisa in September 1966. This event in fact, stimulated early research conducted for several years by single researchers cooperating more with foreign ...
Patrizia M. Gianni   +2 more
openaire   +1 more source

Applications of symbolic algebraic computation

Computer Physics Communications, 1979
Abstract This paper is a survey of applications of systems for symbolic algebraic computation. In most successful applications, calculations that can be taken to a given order by hand are then extended one or two more orders by computer. Furthermore, with a few notable exceptions, these applications also involve numerical computation in some way ...
W.S. Brown, A.C. Hearn
openaire   +1 more source

Numerical algebraic geometry and symbolic computation

Proceedings of the 2004 international symposium on Symbolic and algebraic computation, 2004
In a recent joint work with Andrew Sommese and Charles Wampler, numerical homotopy continuation methods have been developed to deal with positive dimensional solution sets of polynomial systems. As solving polynomial systems is such a fundamental problem, connections with recent research in symbolic computation are not hard to find. We will address two
openaire   +1 more source

Symbolic and algebraic computer programming systems

ACM SIGSAM Bulletin, 1981
To illustrate the difference between numeric and symbolic processing, consider a computer program (in FORTRAN, say) which given the quantities a , b , and c , can apply the quadratic formula to approximate the roots of the quadratic about 40 equation
openaire   +1 more source

Systems for symbolic computations in boolean algebra

Proceedings of the international symposium on Symbolic and algebraic computation, 1990
Boolean algebra as scientific discipline has a few features. It is a pure mathematical theory and, on the other hand, an applied mathematical theory too. Boolean algebra is applied, for instance, to improve intelligence of software, to automate integrated circuit design and theorem proving as it can be used to model situation analysis and decision ...
openaire   +1 more source

Home - About - Disclaimer - Privacy