517 search results - page 38 / 104 » Approximation Algorithms for Scheduling with Reservations |
JCO
2000
14 years 9 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
ICTAI
1993
IEEE
15 years 2 months ago
1993
IEEE
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
ICMCS
2006
IEEE
15 years 4 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
100
click to vote
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
PR
2008
14 years 10 months ago
2008
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD c...