165 search results - page 32 / 33 » Some Pairwise Balanced Designs |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
HPDC
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
LISA
2003
13 years 8 months ago
2003
This paper presents three simple techniques for improving network service using relatively unknown features of many existing networks. The resulting system provides greater reliab...