664 search results - page 7 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
MP
2002
13 years 8 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
SIAMJO
2000
13 years 8 months ago
2000
: Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general set...
EUROPAR
2010
Springer
13 years 6 months ago
2010
Springer
In the numerical solution of large-scale eigenvalue problems, Davidson-type methods are an increasingly popular alternative to Krylov eigensolvers. The main motivation is to avoid ...