1566 search results - page 45 / 314 » On a Cone Covering Problem |
148
click to vote
SIAMJO
2010
15 years 22 days ago
2010
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
155
click to vote
COMPGEOM
2009
ACM
16 years 15 days ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
165
click to vote
NIPS
2007
15 years 7 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
158
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
187
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...