1114 search results - page 65 / 223 » Validating optimizations of concurrent C C programs |
180
click to vote
ICML
2003
IEEE
16 years 6 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
173
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
157
click to vote
IFIP
2005
Springer
15 years 11 months ago
2005
Springer
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...
140
click to vote
SAS
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
173
click to vote
PPSC
1997
15 years 7 months ago
1997
We illustrate how Fortran 90 supports object-oriented concepts by example of plasma particle computations on the IBM SP. Our experience shows that Fortran 90 and object-oriented m...