2354 search results - page 306 / 471 » Randomness, Stochasticity and Approximations |
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
139
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
159
click to vote
SIGCOMM
2006
ACM
16 years 4 days ago
2006
ACM
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
187
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
199
click to vote
EUROCAST
1997
Springer
15 years 10 months ago
1997
Springer
The ability to detect object size, location and movement is essential for a visual system in either a biological or man made environment. In this paper we present a model for esti...