1686 search results - page 120 / 338 » Programs as polygraphs: computability and complexity |
126
Voted
RTS
2000
15 years 3 months ago
2000
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
140
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
124
Voted
PPOPP
2005
ACM
15 years 9 months ago
2005
ACM
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
135
Voted
NC
2008
15 years 3 months ago
2008
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
132
Voted
DAC
1998
ACM
15 years 7 months ago
1998
ACM
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...