1795 search results - page 28 / 359 » On the Complexity of Circuit Satisfiability |
165
click to vote
BCS
2008
15 years 7 months ago
2008
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
We present a framework and control policies for optimizing dynamic control of various self-tuning parameters over lifetime in the presence of circuit aging. Our framework introduc...
162
click to vote
ECOOP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
141
click to vote
COLT
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
146
click to vote
KES
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a system for recognizing sketched logic circuits in real-time and graphically simulating them afterwords. It has been developed for use in university and school...