676 search results - page 83 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
INFORMS
2000
13 years 8 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
ICCD
2003
IEEE
14 years 5 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
WSC
2001
13 years 10 months ago
2001
This paper presents a new approach to pricing Americanstyle derivatives. By approximating the value function with a piecewise linear interpolation function, the option holder'...
ICCAD
2010
IEEE
13 years 6 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...