716 search results - page 28 / 144 » Semilinear Program Feasibility |
SIAMJO
2008
14 years 9 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...
194
click to vote
OL
2011
14 years 4 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
ICSE
2007
IEEE-ACM
15 years 9 months ago
2007
IEEE-ACM
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
116
click to vote
NFM
2011
14 years 4 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...