6554 search results - page 1240 / 1311 » Constraint Logic Programming |
139
click to vote
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
153
Voted
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
125
click to vote
NHM
2010
14 years 10 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
165
Voted
SIAMREV
2010
14 years 10 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
110
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...