290 search results - page 55 / 58 » Lattice-based computation of Boolean functions |
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
13 years 7 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
GECCO
2009
Springer
14 years 5 days ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
BMCBI
2008
13 years 7 months ago
2008
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...