327 search results - page 44 / 66 » Exploiting Problem Decomposition in Multi-objective Constrai... |
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
The traditional shape-from-shading problem, with a single light source and Lambertian reflectance, is challenging since the constraints implied by the illumination are not suffi...
CAD
2000
Springer
13 years 9 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
AAAI
2000
13 years 11 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
CPAIOR
2004
Springer
14 years 3 months ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
ISQED
2009
IEEE
14 years 4 months ago
2009
IEEE
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...