3591 search results - page 68 / 719 » Typing linear constraints |
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
JCP
2008
14 years 9 months ago
2008
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
JOTA
2011
14 years 4 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
MICAI
2004
Springer
15 years 3 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
If we classify the variables of a program into various security levels, then a secure information flow analysis aims to verify statically that information in the program can flo...