Sciweavers

983 search results - page 120 / 197
» Circuit Complexity and Multiplicative Complexity of Boolean ...
Sort
View
CSB
2004
IEEE
125views Bioinformatics» more  CSB 2004»
14 years 1 months ago
Gene Length and Alternative Transcription in Fruit Fly
Alternative transcription, in which a single gene may give rise to multiple variant mRNA forms, is widely recognized as an important source of protein diversity in complex, eukary...
Boris Budagyan, Ann E. Loraine
TNN
1998
112views more  TNN 1998»
13 years 9 months ago
A class of competitive learning models which avoids neuron underutilization problem
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
Clifford Sze-Tsan Choy, Wan-Chi Siu
ECAL
1999
Springer
14 years 2 months ago
Arithmetic Operations on Self-Replicating Cellular Automata
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
Enrico Petraglio, Jean-Marc Henry, Gianluca Tempes...
ISCA
2003
IEEE
150views Hardware» more  ISCA 2003»
14 years 3 months ago
Cyclone: A Broadcast-Free Dynamic Instruction Scheduler with Selective Replay
To achieve high instruction throughput, instruction schedulers must be capable of producing high-quality schedules that maximize functional unit utilization while at the same time...
Dan Ernst, Andrew Hamel, Todd M. Austin
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 2 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...