11 search results - page 1 / 3 » Introducing MONEDA: scalable multiobjective optimization wit... |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
TEC
2008
13 years 4 months ago
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
MVA
2007
13 years 4 months ago
2007
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...