706 search results - page 41 / 142 » On a quasi-ordering on Boolean functions |
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
FOGA
2011
12 years 11 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
FPGA
1998
ACM
13 years 12 months ago
1998
ACM
In this paper, we developed Boolean matching techniques for complex programmable logic blocks (PLBs) in LUT-based FPGAs. A complex PLB can not only be used as a K-input LUT, but a...
ISMVL
2007
IEEE
14 years 2 months ago
2007
IEEE
We generalize the binary Deutsch-Jozsa algorithm to nvalued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced ...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....