767 search results - page 120 / 154 » Logic for Mathematical Writing |
108
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...
135
click to vote
OWLED
2007
15 years 4 months ago
2007
: The mathematical nature of description logics has meant that domain experts find it hard to understand. This forms a significant impediment to the creation and adoption of ontolo...
146
Voted
EUSFLAT
2009
15 years 1 months ago
2009
The need for an automatic inference process able to deal with information coming from unreliable sources is becoming a relevant issue both on corporate networks and on the open Web...
153
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
135
click to vote
JCST
2010
14 years 10 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...