3875 search results - page 527 / 775 » Approximation algorithms for the 0-extension problem |
188
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
205
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
198
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
198
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
183
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We consider energy efficient packet forwarding with quality-of-service (QoS) guarantee for wireless sensor networks (WSNs). In most existing wireless network protocols, route ...