2814 search results - page 146 / 563 » Competitive Analysis of Distributed Algorithms |
149
click to vote
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
123
click to vote
SIROCCO
2000
15 years 3 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
176
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
118
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
225
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
We address the issue of measuring storage, or query load distribution fairness in peer-to-peer data management systems. Existing metrics may look promising from the point of view ...