994 search results - page 14 / 199 » Custom Computing Machines for the Set Covering Problem |
COR
2007
13 years 7 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
SIGUCCS
2003
ACM
14 years 28 days ago
2003
ACM
Working on a small campus has many advantages: Familiarity with the majority of faculty and staff, in-depth knowledge of how systems interact, adding the personal touch to each in...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
EOR
2010
13 years 5 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...