2925 search results - page 118 / 585 » Information Complexity of Online Problems |
183
click to vote
BERTINORO
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...
164
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
161
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
200
click to vote
DATAMINE
2010
15 years 6 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
132
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...