447 search results - page 19 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
VLSID
2008
IEEE
14 years 7 months ago
2008
IEEE
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
AAAI
1998
13 years 8 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
CCR
2006
13 years 7 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...