2171 search results - page 95 / 435 » A Generic Process Algebra |
156
Voted
CALCO
2011
Springer
14 years 24 days ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
98
Voted
WDAG
1999
Springer
15 years 5 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
ECTEL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Learning Design offers the possibility of capturing the process, activities, user organization and resources used in a learning experience. But a wider set of scenarios a...
103
Voted
VTC
2008
IEEE
15 years 7 months ago
2008
IEEE
— When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper...
89
Voted
DSN
2002
IEEE
15 years 5 months ago
2002
IEEE
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...