422 search results - page 47 / 85 » On Non-Approximability for Quadratic Programs |
ATMOS
2007
13 years 9 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
JMLR
2006
13 years 8 months ago
2006
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
IOR
2008
13 years 8 months ago
2008
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we study an optimal control problem arising in plasma transport which is governed by a singularly perturbed system. Time-scale separation allows us to focus on a...