413 search results - page 63 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
116
click to vote
SIGCOMM
2006
ACM
15 years 3 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...