129 search results - page 12 / 26 » Lower Bounds of Computational Power of a Synaptic Calculus |
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
CONCUR
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...