10718 search results - page 108 / 2144 » On the Circuit Implementation Problem |
148
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
95
Voted
PATMOS
2004
Springer
15 years 9 months ago
2004
Springer
A full-adder implemented by combining branch-based logic and pass-gate logic is presented in this contribution. A comparison between this proposed full-adder (named BBL PT) and its...
140
Voted
COCO
2004
Springer
15 years 7 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
126
click to vote
ICCAD
2001
IEEE
16 years 14 days ago
2001
IEEE
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
A new approach to analyze injection locking mode of oscillators under small external excitation is proposed. The proposed approach exploits existence conditions of the solution of...