Group communication is one of the main paradigms for implementing replication middleware. The high run-time costs of group communication may constitute a major performance bottleneck for modern enterprise applications. In this paper we investigate the applicability of message packing, a technique originally proposed by Friedman and Van Renesse in 1997 for improving the performance of group comm...

The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...

Using probabilistic ideas, we prove that if μ is a mean porous measure on R, then the packing dimension of μ is strictly smaller than n. Moreover, we give an explicit bound for the packing dimension, which is asymptotically sharp in the case of small porosity. This result was stated in [D. B. BELIAEV and S. K. SMIRNOV, “On dimension of porous measures”, Math. Ann. 323 (2002) 123-141], but the p...

This paper presents the use of genetic algorithms (GA) for solving the dual bin packing problem using fuzzy objectives. In bin packing problems, a list, L of items is to be packed into a minimum number of bins. In dual bin packing the items are packed into a maximum number of bins, assuring a minimum weight for each bin. We consider a class which we call dynamic dual bin packingg. Similar to th...