206 search results - page 11 / 42 » mp 2006 |
MP
2007
14 years 11 months ago
2007
Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
MP
2010
14 years 10 months ago
2010
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...
CF
2006
ACM
15 years 3 months ago
2006
ACM
This paper presents our experience mapping OpenMP parallel programming model to the IBM Cyclops-64 (C64) architecture. The C64 employs a many-core-on-a-chip design that integrates...
MP
2006
14 years 12 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...
MP
2006
14 years 12 months ago
2006
We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a u...