1647 search results - page 134 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
128
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
136
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
160
click to vote
FLAIRS
2004
15 years 6 months ago
2004
Novelty detection in time series is an important problem with application in different domains such as machine failure detection, fraud detection and auditing. An approach to this...
152
Voted
AI
2003
Springer
15 years 10 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
158
Voted
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...