1612 search results - page 210 / 323 » Analysing Randomized Distributed Algorithms |
135
click to vote
EOR
2010
15 years 2 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
203
Voted
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
140
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
154
Voted
EUROPAR
2009
Springer
15 years 5 days ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
110
Voted
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
We present a novel Bayesian approach to the problem of value function estimation in continuous state spaces. We define a probabilistic generative model for the value function by i...