1300 search results - page 86 / 260 » Constraint satisfaction problems and global cardinality cons... |
SIAMJO
2008
14 years 10 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
DAC
2002
ACM
15 years 11 months ago
2002
ACM
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
85
Voted
HEURISTICS
2008
14 years 8 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
72
Voted
CVPR
2006
IEEE
15 years 4 months ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
81
Voted
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...