725 search results - page 54 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
177
click to vote
MICRO
2010
IEEE
15 years 3 months ago
2010
IEEE
To extend the exponential performance scaling of future chip multiprocessors, improving energy efficiency has become a first-class priority. Single-chip heterogeneous computing ha...
161
click to vote
CORR
2010
Springer
15 years 28 days ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
184
click to vote
JMLR
2008
15 years 6 months ago
2008
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
143
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
149
click to vote
IJCAI
2007
15 years 7 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...