4843 search results - page 364 / 969 » The Shortcut Problem - Complexity and Approximation |
158
click to vote
IPCO
2007
15 years 5 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
155
click to vote
ORL
2006
15 years 4 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
118
Voted
DAC
2009
ACM
16 years 5 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
155
click to vote
ICML
1998
IEEE
16 years 5 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...
148
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...