Sciweavers

52 search results - page 6 / 11
» Characterizing Provability in
Sort
View
CDC
2009
IEEE
14 years 1 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
CSFW
2004
IEEE
14 years 1 months ago
Enforcing Robust Declassification
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems perform intentional release of sensitive informat...
Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 10 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
JCS
2006
118views more  JCS 2006»
13 years 9 months ago
Enforcing Robust Declassification and Qualified Robustness
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems release sensitive information as part of their in...
Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
TSMC
2010
13 years 4 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi