1972 search results - page 275 / 395 » The Timed Asynchronous Distributed System Model |
173
click to vote
MSWIM
2006
ACM
15 years 11 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
146
click to vote
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
157
click to vote
CONCUR
2001
Springer
15 years 9 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
157
click to vote
MMM
2010
Springer
15 years 7 months ago
2010
Springer
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
153
click to vote
ENTCS
2008
15 years 5 months ago
2008
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...