27 search results - page 1 / 6 » Characterizing and reasoning about probabilistic and non-pro... |
JACM
2007
13 years 5 months ago
2007
PSSE
2004
Springer
13 years 11 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
JCST
2010
13 years 10 days ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
ICMI
2003
Springer
13 years 10 months ago
2003
Springer
We present methods for inferring the cost of interrupting users based on multiple streams of events including information generated by interactions with computing devices, visual ...
LMCS
2006
13 years 5 months ago
2006
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...