Sciweavers

1483 search results - page 96 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 2 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
DATE
2006
IEEE
124views Hardware» more  DATE 2006»
15 years 7 months ago
Timing-driven cell layout de-compaction for yield optimization by critical area minimization
This paper proposes a yield optimization method for standard-cells under timing constraints. Yield-aware logic synthesis and physical optimization require yield-enhanced standard ...
Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 2 months ago
An evolutionary approach for competency-based curriculum sequencing
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
Luis de Marcos, José-Javier Martínez...
CPAIOR
2010
Springer
14 years 11 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
SIGGRAPH
1998
ACM
15 years 5 months ago
Non-distorted Texture Mapping for Sheared Triangulated Meshes
This article introduces new techniques for non-distorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by u...
Bruno Lévy, Jean-Laurent Mallet