Sciweavers

14 search results - page 3 / 3
» Improved Approximation for Vector Bin Packing
Sort
View
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
13 years 6 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
IFIP
2004
Springer
13 years 11 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
VTC
2007
IEEE
100views Communications» more  VTC 2007»
14 years 15 days ago
Downlink Steered Space-Time Spreading Assisted Generalised Multicarrier DS-CDMA Using Sphere-Packing-Aided Multilevel Coding
— This paper presents a novel generalised Multi-Carrier Direct Sequence Code Division Multiple Access (MC DS-CDMA) system invoking smart antennas for improving the achievable per...
Mohammed El-Hajjar, Ronald Y. S. Tee, Hu Bin, Lie-...
MOBIQUITOUS
2005
IEEE
13 years 11 months ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian