256 search results - page 33 / 52 » A New Synchronous Lower Bound for Set Agreement |
CONCUR
1997
Springer
13 years 12 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
CAAN
2007
Springer
13 years 11 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
FORMATS
2009
Springer
13 years 11 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
AMC
2006
13 years 7 months ago
2006
Missing values in inputs, outputs cannot be handled by the original data envelopment analysis (DEA) models. In this paper we introduce an approach based on interval DEA that allow...