4843 search results - page 205 / 969 » The Shortcut Problem - Complexity and Approximation |
178
click to vote
CDC
2008
IEEE
16 years 29 days ago
2008
IEEE
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
167
click to vote
CEC
2008
IEEE
16 years 29 days ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
151
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
201
click to vote
ICPR
2006
IEEE
2006
IEEE
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
16 years 15 days ago
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
175
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...