246 search results - page 26 / 50 » Dynamic Local Search for the Maximum Clique Problem |
CGF
2008
14 years 9 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
ICTAI
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
4OR
2010
14 years 8 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...