414 search results - page 44 / 83 » Rate of change load balancing in distributed and parallel sy... |
106
Voted
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
102
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
111
Voted
NOSSDAV
1993
Springer
15 years 4 months ago
1993
Springer
–A video-on-demand server must satisfy a large customer base and a diverse archive of movies under changing movie popularity and daily load peaks. These requirements must be sati...
121
click to vote
PODC
2003
ACM
15 years 5 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
92
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Determinant Quantum Monte Carlo (DQMC) simulation has been widely used to reveal macroscopic properties of strong correlated materials. However, parallelization of the DQ...