Sciweavers

454 search results - page 53 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
COR
2008
122views more  COR 2008»
15 years 1 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
FOCM
2002
108views more  FOCM 2002»
15 years 1 months ago
Geometric Integration Algorithms on Homogeneous Manifolds
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
Debra Lewis, Peter J. Olver
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
15 years 2 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
ICALP
2010
Springer
15 years 6 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
CSDA
2006
94views more  CSDA 2006»
15 years 1 months ago
Simulation-based approach to estimation of latent variable models
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
Zhiguang Qian, Alexander Shapiro