Sciweavers

1552 search results - page 147 / 311
» On the Complexity of Constant Propagation
Sort
View
ICCD
2003
IEEE
113views Hardware» more  ICCD 2003»
16 years 4 months ago
Exploiting Microarchitectural Redundancy For Defect Tolerance
Continued advancements in fabrication technology and reductions in feature size create challenges in maintaining both manufacturing yield rates and long-term reliability of device...
Premkishore Shivakumar, Stephen W. Keckler, Charle...
SIES
2009
IEEE
16 years 1 months ago
Programmable temporal isolation through variable-bandwidth servers
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...
Silviu S. Craciunas, Christoph M. Kirsch, Hannes P...
SAT
2009
Springer
94views Hardware» more  SAT 2009»
16 years 1 months ago
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
FGR
2008
IEEE
197views Biometrics» more  FGR 2008»
16 years 1 months ago
Robust real-time 3D time-of-flight based gesture navigation
: Contactless Human-Machine-Interfaces (HMIs) are an important issue in various applications where a haptic interaction with an input device is not possible or not appropriate. New...
Jochen Penne, Stefan Soutschek, Lukas Fedorowicz, ...
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
16 years 1 months ago
Bounded Queries and the NP Machine Hypothesis
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
Richard Chang, Suresh Purini