5 search results - page 1 / 1 » A new lower bound for the non-oriented two-dimensional bin-p... |
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
ESA
2004
Springer
13 years 8 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...