Sciweavers

1795 search results - page 28 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
BCS
2008
13 years 10 months ago
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
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...
Paul Cockshott, Andreas Koltes, John O'Donnell, Pa...
DATE
2010
IEEE
119views Hardware» more  DATE 2010»
14 years 1 months ago
Optimized self-tuning for circuit aging
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...
Evelyn Mintarno, Joelle Skaf, Rui Zheng, Jyothi Ve...
ECOOP
2007
Springer
14 years 17 days ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
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...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
COLT
2007
Springer
14 years 2 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
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...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
KES
2005
Springer
14 years 2 months ago
Recognizing and Simulating Sketched Logic Circuits
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...
Marcus Liwicki, Lars Knipping