Sciweavers

10901 search results - page 245 / 2181
» Approximations in Distributed Optimization
Sort
View
IJSN
2007
73views more  IJSN 2007»
15 years 6 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
ORL
2010
108views more  ORL 2010»
15 years 1 months ago
Easy distributions for combinatorial optimization problems with probabilistic constraints
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
Bernard Fortz, Michael Poss
IPPS
2003
IEEE
15 years 12 months ago
Optimizing Performance and Reliability in Distributed Computing Systems through Wide Spectrum Storage
In this paper, we provide an overview of Logistical Runtime System (LoRS). LoRS is an integrated ensemble of tools and services that aggregate primitive (best effort, faulty) stor...
James S. Plank, Micah Beck, Jack Dongarra, Richard...
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 4 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
ICASSP
2009
IEEE
16 years 1 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...