#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2002

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Heinz Mühlenbein, Robin Höns
- Evolutionary Computation
- 2005

Estimation of Distribution Algorithms (EDA) have been proposed as an extension of genetic algorithms. In this paper we explain the relationship of EDA to algorithms developed in statistics, artificial intelligence, and statistical physics. The major design issues are discussed within a general interdisciplinary framework. It is shown that maximum entropy… (More)

- Robin Höns
- 2005

In the field of optimization using probabilistic models of the search space, this thesis identifies and elaborates several advancements in which the principles of maximum en-tropy and minimum relative entropy from information theory are used to estimate a probability distribution. The probability distribution within the search space is represented by a… (More)

- Heinz Mühlenbein, Robin Höns
- Theory of Evolutionary Algorithms
- 2006

Estimation of Distribution Algorithms (EDA) have been proposed as an extension of genetic algorithms. In this paper the major design issues of EDA's are discussed using an interdisciplinary framework, the minimum relative entropy (M inRel) approximation. We assume that the function to be optimized is additively decomposed (ADF). The interaction graph GADF… (More)

In this paper we address the problem of using region-based approximations to find the optimal points of a given function. Our approach combines the use of Kikuchi approximations with the application of generalized belief propagation (GBP) using maximization instead of marginalization. The relationship between the fixed points of maximum GBP and the free… (More)

- Heinz Mühlenbein, Robin Höns
- Advances in Complex Systems
- 2002

- Heinz Mühlenbein, Robin Höns
- GECCO Workshops
- 2005

Estimation of Distribution Algorithms (EDA) have been proposed as an extension of genetic algorithms. In this paper the major design issues of EDA's are discussed within a general interdisciplinary framework, the <i>maximum entropy</i> approximation. Our EDA algorithm <i>FDA</i> assumes that the function to be optimized is additively decomposed (ADF). The… (More)

- Heinz Mühlenbein, Robin Höns
- ACRI
- 2002

- Alexandru Agapie, Robin Höns, Adriana Agapie
- Mathematical Social Sciences
- 2010

We investigate theoretically a voter model-or how opinion changes within a community, subject to neighborhood interaction. Under Markov chain modeling, the stationary probability distribution for certain cases is determined in simple analytical form, then its entropy is analyzed.

- ‹
- 1
- ›