16404 search results - page 477 / 3281 » A set coverage problem |
171
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
189
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
172
click to vote
JCDL
2005
ACM
16 years 11 days ago
2005
ACM
In this paper, we consider the problem of ambiguous author names in bibliographic citations, and comparatively study alternative approaches to identify and correct such name varia...
165
click to vote
SIGECOM
2005
ACM
16 years 11 days ago
2005
ACM
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...
207
click to vote
BERTINORO
2005
Springer
16 years 11 days ago
2005
Springer
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes are connected by bidirectional links and the total powe...