Sciweavers

5331 search results - page 793 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
DAM
2007
177views more  DAM 2007»
15 years 6 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
CVPR
2012
IEEE
13 years 9 months ago
Robust late fusion with rank minimization
In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...
Guangnan Ye, Dong Liu, I-Hong Jhuo, Shih-Fu Chang
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
16 years 4 days ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
16 years 4 days ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
15 years 11 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...