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...
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...
— 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-...
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 ...