Sciweavers

5331 search results - page 217 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
PPSN
2004
Springer
15 years 12 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
CEC
2008
IEEE
16 years 1 months ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan
VLSM
2005
Springer
16 years 9 hour ago
Fast Marching Method for Generic Shape from Shading
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
Emmanuel Prados, Stefano Soatto
IJACTAICIT
2010
160views more  IJACTAICIT 2010»
15 years 3 months ago
Concentric Circular Array Antenna Null Steering Synthesis by Using Modified Hybrid Ant Colony System Algorithm
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...
Ali Abdulhadi Noaman
SIAMNUM
2010
118views more  SIAMNUM 2010»
15 years 1 months ago
Discontinuous Galerkin Methods for Solving Elliptic Variational Inequalities
Abstract. We study discontinuous Galerkin methods for solving elliptic variational inequalities, of both the first and second kinds. Analysis of numerous discontinuous Galerkin sch...
Fei Wang, Weimin Han, Xiao-Liang Cheng