16596 search results - page 384 / 3320 » Generalized Assignment Problems |
233
Voted
MOBIHOC
2006
ACM
16 years 7 months ago
2006
ACM
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
226
click to vote
WSDM
2009
ACM
16 years 2 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
202
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
189
click to vote
DCOSS
2009
Springer
16 years 2 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
223
Voted
CSFW
2011
IEEE
14 years 7 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...