40212 search results - page 7835 / 8043 » More |
126
click to vote
RSA
2010
15 years 2 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
162
click to vote
RTAS
2010
IEEE
15 years 2 months ago
2010
IEEE
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
148
click to vote
RTS
2010
15 years 2 months ago
2010
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
156
click to vote
RV
2010
Springer
15 years 2 months ago
2010
Springer
This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
162
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...