14386 search results - page 223 / 2878 » The Chinese Generals Problem |
117
click to vote
CSSC
2008
15 years 4 months ago
2008
For the two-sample location problem we consider a general class of tests, all members of it are based on U-statistics. The asymptotic efficicacies are investigated in detail. We c...
123
click to vote
EOR
2006
15 years 4 months ago
2006
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
130
click to vote
MP
2006
15 years 4 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
113
click to vote
MOC
2002
15 years 4 months ago
2002
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
157
click to vote
SIAMJO
2010
14 years 11 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...