2485 search results - page 124 / 497 » Time Bounded Frequency Computations |
132
Voted
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
171
Voted
ECOOP
1993
Springer
15 years 9 months ago
1993
Springer
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...
140
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
133
click to vote
LATIN
1998
Springer
15 years 9 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
127
click to vote
IMC
2003
ACM
15 years 10 months ago
2003
ACM
SNMP statistics are usually collected over intervals of 5 minutes and correspond to average activity of IP links and network elements for the duration of the interval. Nevertheles...