706 search results - page 52 / 142 » Super Solutions in Constraint Programming |
142
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
14 years 6 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
VLSID
2007
IEEE
16 years 5 days ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
154
click to vote
PLDI
1997
ACM
15 years 4 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
CP
2010
Springer
14 years 10 months ago
2010
Springer
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
124
click to vote
FM
2008
Springer
15 years 1 months ago
2008
Springer
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...