7930 search results - page 59 / 1586 » Greedy in Approximation Algorithms |
110
Voted
STACS
2004
Springer
15 years 8 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
134
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
148
click to vote
PVLDB
2011
14 years 9 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...
146
click to vote
INFOCOM
2010
IEEE
14 years 12 months ago
2010
IEEE
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
125
Voted
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...