170 search results - page 3 / 34 » Properties and Applications of Programs with Monotone and Co... |
AUTOMATICA
2006
14 years 9 months ago
2006
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
87
Voted
OL
2011
14 years 11 days ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
84
Voted
AAAI
2004
14 years 11 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
WADS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
MP
2011
14 years 11 days ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...