442 search results - page 89 / 89 » Parallel programming over ChinaGrid |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
115
click to vote
IFM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...