5639 search results - page 61 / 1128 » Timed Abstract Non-interference |
EOR
2002
14 years 11 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
AAIM
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
FCT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
EUROPAR
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. A practical methodology for compilation of trustworthy realtime programs is introduced. It combines new program development and timing analysis techniques with traditiona...
DALT
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We...