16 search results - page 3 / 4 » Asynchronous Multiparty Computation: Theory and Implementati... |
ASYNC
2000
IEEE
13 years 9 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
STOC
1993
ACM
13 years 9 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
PIMRC
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
TON
2002
13 years 5 months ago
2002
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
EMSOFT
2006
Springer
13 years 9 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...