103 search results - page 21 / 21 » The Cover Time of Random Digraphs |
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
—This paper investigates throughput and delay based on a newly predominant traffic pattern, called converge-cast, where each of the n nodes in the network act as a destination w...
SIGECOM
2011
ACM
12 years 9 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
COMPGEOM
2010
ACM
14 years 1 days ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...