1243 search results - page 166 / 249 » On the locality of bounded growth |
194
click to vote
QEST
2007
IEEE
16 years 20 days ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
193
click to vote
RTSS
2007
IEEE
16 years 20 days ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
148
click to vote
COCOON
2007
Springer
16 years 17 days ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
144
click to vote
ESOP
2007
Springer
16 years 17 days ago
2007
Springer
In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that c...
170
click to vote
FORMATS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...