Sciweavers

373 search results - page 4 / 75
» Learning Arithmetic Circuits
Sort
View
ECAL
2005
Springer
13 years 11 months ago
How Do Evolved Digital Logic Circuits Generalise Successfully?
Contrary to indications made by prior researchers, digital logic circuits designed by artificial evolution to perform binary arithmetic tasks can generalise on inputs which were n...
Simon McGregor
FSTTCS
2009
Springer
14 years 10 days ago
The Power of Depth 2 Circuits over Algebras
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
13 years 7 months ago
Analog circuit simulation using range arithmetics
The impact of parameter variations in integrated analog circuits is usually analyzed by Monte Carlo methods with a high number of simulation runs. Few approaches based on interval ...
Darius Grabowski, Markus Olbrich, Erich Barke
ECCC
2010
89views more  ECCC 2010»
13 years 5 months ago
Read-Once Polynomial Identity Testing
An arithmetic read-once formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+,
Amir Shpilka, Ilya Volkovich
TEC
2002
119views more  TEC 2002»
13 years 5 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...