8413 search results - page 236 / 1683 » Ordering Problem Subgoals |
145
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
146
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
151
click to vote
JSYML
2000
15 years 6 months ago
2000
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
148
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
159
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...