719 search results - page 5 / 144 » Solving Sparse Linear Constraints |
CAV
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
UIST
1997
ACM
14 years 2 months ago
1997
ACM
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring th...
CSCLP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
PC
2000
13 years 9 months ago
2000
In this paper we present a parallel method for solving two-stage stochastic linear programs with restricted recourse. The mathematical model considered here can be used to represe...
SAC
2005
ACM
14 years 3 months ago
2005
ACM