5331 search results - page 24 / 1067 » Algebraic Methods for Optimization Problems |
SIAMJO
2008
14 years 11 months ago
2008
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear ...
101
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...