88 search results - page 14 / 18 » Matching Systems for Concurrent Calculi |
78
Voted
IANDC
2010
14 years 8 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
100
click to vote
POPL
2012
ACM
13 years 5 months ago
2012
ACM
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
79
Voted
HPCA
2008
IEEE
15 years 4 months ago
2008
IEEE
With reducing feature size, increasing chip capacity, and increasing clock speed, microprocessors are becoming increasingly susceptible to transient (soft) errors. Redundant multi...
COOPIS
1998
IEEE
15 years 1 months ago
1998
IEEE
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
78
Voted
ICB
2009
Springer
15 years 4 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...