4075 search results - page 340 / 815 » Modeling Distributed Algorithm Using B |
176
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
210
click to vote
FORMATS
2004
Springer
16 years 4 days ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
176
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
170
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
160
click to vote
ADMA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...