5 search results - page 1 / 1 » A Decomposition Theorem for Probabilistic Transition Systems |
STACS
1993
Springer
13 years 9 months ago
1993
Springer
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
SMA
2005
ACM
13 years 11 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
ICTIR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. The PageRank algorithm is used today within web information retrieval to provide a content-neutral ranking metric over web pages. It employs power method iterations to so...