Sciweavers

128 search results - page 25 / 26
» Declarative Representation of Proof Terms
Sort
View
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 5 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
13 years 11 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
13 years 10 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 10 months ago
Evolving the placement and density of neurons in the hyperneat substrate
The Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach demonstrated that the pattern of weights across the connectivity of an artificial neural network ...
Sebastian Risi, Joel Lehman, Kenneth O. Stanley