3638 search results - page 19 / 728 » Distribution chain security |
ACISP
2001
Springer
13 years 11 months ago
2001
Springer
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
MANSCI
2010
13 years 6 months ago
2010
We study a supply chain with one supplier and many retailers that face exogenous endcustomer demands. The supplier and the retailers all try to minimize their own inventory-relate...
ESORICS
2004
Springer
14 years 1 months ago
2004
Springer
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...
SPIN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...