Sciweavers

1833 search results - page 45 / 367
» A Matrix-Based Approach to the Global Locality Optimization ...
Sort
View
ICANNGA
2009
Springer
163views Algorithms» more  ICANNGA 2009»
14 years 16 days ago
Elitistic Evolution: An Efficient Heuristic for Global Optimization
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
Francisco Viveros Jiménez, Efrén Mez...
ANTSW
2010
Springer
13 years 6 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 1 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
JOTA
2011
149views more  JOTA 2011»
13 years 3 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
CVPR
1997
IEEE
14 years 27 days ago
Normalized Cuts and Image Segmentation
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
Jianbo Shi, Jitendra Malik