545 search results - page 70 / 109 » Simultaneous approximation by greedy algorithms |
143
click to vote
ICDT
2005
ACM
15 years 9 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
161
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
172
Voted
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
125
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
151
Voted
IPPS
2009
IEEE
15 years 10 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...