Sciweavers

2814 search results - page 367 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
CLUSTER
2004
IEEE
14 years 2 months ago
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema
ISCI
2010
111views more  ISCI 2010»
13 years 8 months ago
Effective vaccination policies
We present a framework for modeling the spread of pathogens throughout a population and generating policies that minimize the impact of those pathogens on the population. This fra...
L. Shaw, W. Spears, L. Billings, P. Maxim
SIGOPS
2010
127views more  SIGOPS 2010»
13 years 8 months ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...
EDBT
2012
ACM
224views Database» more  EDBT 2012»
12 years 24 days ago
Aggregate queries on probabilistic record linkages
Record linkage analysis, which matches records referring to the same real world entities from different data sets, is an important task in data integration. Uncertainty often exi...
Ming Hua, Jian Pei
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking