Sciweavers

61 search results - page 10 / 13
» Arbitrary Bit Permutations in One or Two Cycles
Sort
View
ACRI
2004
Springer
15 years 1 months ago
Characterizing Configuration Spaces of Simple Threshold Cellular Automata
We study herewith the simple threshold cellular automata (CA), as perhaps the simplest broad class of CA with non-additive (i.e., non-linear and non-affine) local update rules. We ...
Predrag T. Tosic, Gul Agha
TIT
2008
87views more  TIT 2008»
14 years 9 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga
APCSAC
2005
IEEE
15 years 3 months ago
Speculative Issue Logic
In order to enhance the performance of a computer, most modern processors use superscalar architecture and raise the clock frequency. Superscalar architecture can execute more than...
You-Jan Tsai, Jong-Jiann Shieh
SAS
2007
Springer
108views Formal Methods» more  SAS 2007»
15 years 3 months ago
Programming Language Design and Analysis Motivated by Hardware Evolution
Abstract. Silicon chip design has passed a threshold whereby exponentially increasing transistor density (Moore’s Law) no longer translates into increased processing power for si...
Alan Mycroft
RECOMB
2004
Springer
15 years 9 months ago
Reconstructing reticulate evolution in species: theory and practice
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...
Luay Nakhleh, Tandy Warnow, C. Randal Linder