Sciweavers

5600 search results - page 34 / 1120
» Synthesizing robust systems
Sort
View
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
15 years 11 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
171
Voted
SYNTHESE
2008
69views more  SYNTHESE 2008»
15 years 7 months ago
Dispositional implementation solves the superfluous structure problem
Abstract. Consciousness supervenes on activity; computation supervenes on structure. Because of this, some argue, conscious states cannot supervene on computational ones. If true, ...
Colin Klein
143
Voted
SYNTHESE
2010
59views more  SYNTHESE 2010»
15 years 5 months ago
Frege's Begriffsschrift as a lingua characteristica
In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua ch...
Tapio Korte
160
Voted
SYNTHESE
2010
98views more  SYNTHESE 2010»
15 years 5 months ago
Bolzano a priori knowledge, and the Classical Model of Science
This paper is aimed at understanding one central aspect of Bolzano’s views on deductive knowledge: what it means for a proposition and for a term to be known a priori. I argue t...
Sandra Lapointe
161
Voted
RTSS
2002
IEEE
16 years 10 days ago
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
abstractions + algorithms For Robustness to Timing Faults A new optimality criterion + algorithms
John Regehr