Sciweavers

1927 search results - page 2 / 386
» UMDAs for dynamic optimization problems
Sort
View
CEC
2007
IEEE
13 years 11 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 11 months ago
Addressing sampling errors and diversity loss in UMDA
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
Jürgen Branke, Clemens Lode, Jonathan L. Shap...
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
13 years 8 months ago
Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
Yunpeng Cai, Xiaomin Sun, Peifa Jia
SSPR
2010
Springer
13 years 3 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
13 years 4 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius