994 search results - page 36 / 199 » Custom Computing Machines for the Set Covering Problem |
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
105
Voted
ALMOB
2006
15 years 26 days ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
EUROPAR
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
147
Voted
TASE
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
112
Voted
EOR
2007
15 years 23 days ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...