10718 search results - page 142 / 2144 » On the Circuit Implementation Problem |
131
click to vote
ACL
2012
13 years 6 months ago
2012
This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research ha...
113
Voted
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
124
click to vote
ISQED
2008
IEEE
15 years 10 months ago
2008
IEEE
Correct input/output behavior of circuits in presence of internal malfunctions becomes more and more important. But reliable and efficient methods to measure this robustness are ...
127
click to vote
EUROGP
2008
Springer
15 years 5 months ago
2008
Springer
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
114
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...