4781 search results - page 70 / 957 » Online algorithms for network design |
131
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
221
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
107
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
We consider a multiagent system whose task is to aid componentcentered design by collaborative designers in a supply chain. In the earlier work, collaborative design networks are ...
102
click to vote
CCR
2002
15 years 1 months ago
2002
This paper describes the results of a 500 million packet trace of a popular on-line, multi-player, game server. The results show that the traffic behavior of this heavily loaded ga...
142
click to vote
WSDM
2012
ACM
13 years 9 months ago
2012
ACM
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...