4131 search results - page 13 / 827 » The Generalized Max-Controlled Set Problem |
179
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
131
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
148
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
135
click to vote
DISOPT
2007
15 years 5 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
162
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...