6480 search results - page 271 / 1296 » Proximity Communication and Time |
189
click to vote
QUESTA
2010
15 years 1 months ago
2010
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room f...
148
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
201
click to vote
TPDS
2008
15 years 6 months ago
2008
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
188
click to vote
DSN
2007
IEEE
16 years 1 months ago
2007
IEEE
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
180
click to vote
BIRTHDAY
2000
Springer
15 years 11 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...