1399 search results - page 219 / 280 » Multi-party Finite Computations |
259
click to vote
ICNP
1996
IEEE
15 years 8 months ago
1996
IEEE
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...
123
click to vote
MFCS
1997
Springer
15 years 8 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
117
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
119
click to vote
COLT
1992
Springer
15 years 8 months ago
1992
Springer
Machine learning of limit programs (i.e., programs allowed finitely many mind changes about their legitimate outputs) for computable functions is studied. Learning of iterated lim...
117
Voted
SPAA
1990
ACM
15 years 8 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...