716 search results - page 1 / 144 » Semilinear Program Feasibility |
ICALP
2009
Springer
13 years 8 months ago
2009
Springer
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
SWAT
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
SIAMJO
2008
13 years 4 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
MP
2007
13 years 4 months ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...