2814 search results - page 331 / 563 » Competitive Analysis of Distributed Algorithms |
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
AUTOMATICA
1999
13 years 10 months ago
1999
We develop and analyze an algorithm to maximize the throughput of a serial kanbanbased manufacturing system with arbitrary arrival and service process distributions by adjusting t...
EDCC
2005
Springer
14 years 4 months ago
2005
Springer
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...