Sciweavers

1144 search results - page 10 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
15 years 1 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
CVPR
2010
IEEE
15 years 6 months ago
Fast Global Optimization of Curvature
Two challenges in computer vision are to accommodate noisy data and missing data. Many problems in computer vision, such as segmentation, filtering, stereo, reconstruction, inpain...
Noha El-Zehiry, Leo Grady
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 3 months ago
Two improved differential evolution schemes for faster global search
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of D...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
14 years 4 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
CPAIOR
2005
Springer
15 years 3 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker