Sciweavers

120 search results - page 7 / 24
» Functions Definable by Arithmetic Circuits
Sort
View
DAC
2008
ACM
14 years 8 months ago
The synthesis of robust polynomial arithmetic with stochastic logic
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
Weikang Qian, Marc D. Riedel
IJAR
2006
125views more  IJAR 2006»
13 years 7 months ago
Compiling relational Bayesian networks for exact inference
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propos...
Mark Chavira, Adnan Darwiche, Manfred Jaeger
ISMVL
2010
IEEE
174views Hardware» more  ISMVL 2010»
14 years 7 days ago
Quaternary Voltage-Mode Logic Cells and Fixed-Point Multiplication Circuits
—Fixed-point multiplication architectures are designed and evaluated using a set of logic cells based on a radix-4, quaternary number system. The library of logic circuits is bas...
Satyendra R. Datla, Mitchell A. Thornton
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
13 years 11 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
GECCO
2000
Springer
182views Optimization» more  GECCO 2000»
13 years 11 months ago
A Novel Evolvable Hardware Framework for the Evolution of High Performance Digital Circuits
This paper presents a novel evolvable hardware framework for the automated design of digital circuits for high performance applications. The technique evolves circuits correspondi...
Ben I. Hounsell, Tughrul Arslan