82 search results - page 1 / 17 » Trans-Dichotomous Algorithms Without Multiplication - Some U... |
FOCS
2007
IEEE
13 years 9 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
COMSWARE
2007
IEEE
13 years 12 months ago
2007
IEEE
— Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound...
SIGECOM
2009
ACM
14 years 4 days ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
ICT
2004
Springer
13 years 11 months ago
2004
Springer
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
BMCBI
2007
13 years 5 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...