default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeinz Mühlenbein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2007
[j32]Heinz Mühlenbein, Lyudmila Zinchenko
, Victor Kureichik, Thilo Mahnig:
Effective mutation rate for probabilistic evolutionary design of analogue electrical circuits. Appl. Soft Comput. 7(3): 1012-1018 (2007)- 2006
- [j31]Heinz Mühlenbein:
Artificial Intelligence and Neural Networks the Legacy of Alan Turing and John von Neumann. Int. J. Comput. 5(3): 10-20 (2006) - 2005
- [j30]Heinz Mühlenbein, Robin Höns:
The Estimation of Distributions and the Minimum Relative Entropy Principle. Evol. Comput. 13(1): 1-27 (2005) - 2004
- [j29]Heinz Mühlenbein, Thomas Aus der Fünten:
An Investigation of the Phase Transitions of a Family of Probabilistic Automata. Adv. Complex Syst. 7(1): 93-123 (2004) - [j28]Ashish Ghosh, Heinz Mühlenbein:
Univariate marginal distribution algorithms for non-stationary optimization problems. Int. J. Knowl. Based Intell. Eng. Syst. 8(3): 129-138 (2004) - [j27]Qingfu Zhang, Heinz Mühlenbein:
On the convergence of a class of estimation of distribution algorithms. IEEE Trans. Evol. Comput. 8(2): 127-136 (2004) - 2003
- [j26]Pedro Larrañaga, José Antonio Lozano, Heinz Mühlenbein:
Algoritmos de Estimación de Distribuciones en Problemas de Optimización Combinatoria. Inteligencia Artif. 7(19): 149-168 (2003) - 2002
- [j25]Frank Schweitzer, Laxmidhar Behera, Heinz Mühlenbein:
Evolution of Cooperation in a Spatial Prisoner's Dilemma. Adv. Complex Syst. 5(2-3): 269-300 (2002) - [j24]Heinz Mühlenbein, Robin Höns:
Stochastic Analysis of Cellular Automata with Application to the Voter Model. Adv. Complex Syst. 5(2-3): 301-338 (2002) - [j23]Heinz Mühlenbein, Thilo Mahnig:
Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. Int. J. Approx. Reason. 31(3): 157-192 (2002) - [j22]Heinz Mühlenbein, Thilo Mahnig:
Evolutionary computation and Wright's equation. Theor. Comput. Sci. 287(1): 145-165 (2002) - 2000
- [j21]Heinz Mühlenbein, Thilo Mahnig:
Evolutionary Optimization Using Graphical Models. New Gener. Comput. 18(2): 157-166 (2000) - 1999
- [j20]Heinz Mühlenbein, Thilo Mahnig:
FDA - A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions. Evol. Comput. 7(4): 353-376 (1999) - [j19]Heinz Mühlenbein, Thilo Mahnig, Alberto Ochoa-Rodríguez:
Schemata, Distributions and Graphical Models in Evolutionary Optimization. J. Heuristics 5(2): 215-247 (1999) - 1997
- [j18]Byoung-Tak Zhang, Peter Ohm, Heinz Mühlenbein:
Evolutionary Induction of Sparse Neural Trees. Evol. Comput. 5(2): 213-236 (1997) - [j17]Heinz Mühlenbein:
The Equation for Response to Selection and Its Use for Prediction. Evol. Comput. 5(3): 303-346 (1997) - 1995
- [j16]Byoung-Tak Zhang, Heinz Mühlenbein:
Balancing Accuracy and Parsimony in Genetic Programming. Evol. Comput. 3(1): 17-38 (1995) - [j15]Heinz Mühlenbein:
Grenzen der Künstlichen Intelligenz - ein Plädoyer für Bescheidenheit. Künstliche Intell. 9(1): 46-51 (1995) - 1993
- [j14]Byoung-Tak Zhang, Heinz Mühlenbein:
Evolving Optimal Neural Networks Using Genetic Algorithms with Occam's Razor. Complex Syst. 7(3) (1993) - [j13]Heinz Mühlenbein, Dirk Schlierkamp-Voosen:
Predictive Models for the Breeder Genetic Algorithm, I: Continuous Parameter Optimization. Evol. Comput. 1(1): 25-49 (1993) - [j12]Heinz Mühlenbein, Dirk Schlierkamp-Voosen:
The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA). Evol. Comput. 1(4): 335-360 (1993) - 1991
- [j11]Heinz Mühlenbein:
Darwin's Continent Cycle Theory and Its Simulation by the Prisoner's Dilemma. Complex Syst. 5(5) (1991) - [j10]Heinz Mühlenbein, M. Schomisch, Joachim Born:
The parallel genetic algorithm as function optimizer. Parallel Comput. 17(6-7): 619-632 (1991) - 1990
- [j9]Heinz Mühlenbein:
Limitations of multi-layer perceptron networks-steps towards genetic neural networks. Parallel Comput. 14(3): 249-260 (1990) - [j8]Frank J. Smieja, Heinz Mühlenbein:
The geometry of multi-layer perceptron solutions. Parallel Comput. 14(3): 261-275 (1990) - 1989
- [j7]Ottmar Krämer, Heinz Mühlenbein:
Mapping strategies in message-based multiprocessor systems. Parallel Comput. 9(2): 213-225 (1989) - 1988
- [j6]Heinz Mühlenbein, Th. Schneider, Siegfried Streitz:
Network Programming with MUPPET. J. Parallel Distributed Comput. 5(5): 641-653 (1988) - [j5]Heinz Mühlenbein, Martina Gorges-Schleuter, Ottmar Krämer:
Evolution algorithms in combinatorial optimization. Parallel Comput. 7(1): 65-85 (1988) - [j4]Heinz Mühlenbein, Ottmar Krämer, F. Limburger, Monika Mevenkamp, Siegfried Streitz:
MUPPET: a programming environment for message-based multiprocessors. Parallel Comput. 8(1-3): 201-221 (1988) - 1987
- [j3]Heinz Mühlenbein, Martina Gorges-Schleuter, Ottmar Krämer:
New solutions to the mapping problem of parallel systems: The evolution approach. Parallel Comput. 4(3): 269-279 (1987) - 1986
- [j2]Hans-Christian Hoppe, Heinz Mühlenbein:
Parallel adaptive full-multigrid methods on message-based multiprocessors. Parallel Comput. 3(4): 269-287 (1986) - 1984
- [j1]Michael Spenke, Heinz Mühlenbein, Monika Mevenkamp, Friedemann Mattern, Christian Beilken:
A Language Independent Error Recovery Method for LL(1) Parsers. Softw. Pract. Exp. 14(11): 1095-1107 (1984)
Conference and Workshop Papers
- 2005
- [c45]Heinz Mühlenbein, Robin Höns:
Approximate factorizations of distributions and the minimum relative entropy principle. GECCO Workshops 2005: 199-211 - 2003
- [c44]Carlos Alberto Ochoa Ortíz Zezzatti, Robin Höns, Marta Soto, Heinz Mühlenbein:
A Maximum Entropy Approach to Sampling in EDA ? The Single Connected Case. CIARP 2003: 683-690 - [c43]Lyudmila Zinchenko, Heinz Mühlenbein, Victor Kureichik, Thilo Mahnig:
A Comparison of Different Circuit Representations for Evolutionary Analog Circuit Design. ICES 2003: 13-23 - 2002
- [c42]Heinz Mühlenbein, Robin Höns:
Stochastic Analysis of Cellular Automata and the Voter Model. ACRI 2002: 92-103 - [c41]Heinz Mühlenbein, Thilo Mahnig:
A comparison of stochastic local search and population based search. IEEE Congress on Evolutionary Computation 2002: 255-260 - [c40]Roberto Santana, Heinz Mühlenbein:
Blocked stochastic sampling versus Estimation of Distribution Algorithms. IEEE Congress on Evolutionary Computation 2002: 1390-1395 - [c39]Lyudmila Zinchenko, Heinz Mühlenbein, Victor Kureichik, Thilo Mahnig:
Application of the Univariate Marginal Distribution Algorithm to Analog Circuit Design. Evolvable Hardware 2002: 93-101 - [c38]Heinz Mühlenbein, Thilo Mahnig:
Evolutionary Algorithms and the Boltzmann Distribution. FOGA 2002: 133-150 - 2001
- [c37]Thilo Mahnig, Heinz Mühlenbein:
A new adaptive Boltzmann selection schedule SDS. CEC 2001: 183-190 - [c36]Thilo Mahnig, Heinz Mühlenbein:
Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms. SAGA 2001: 33-48 - 2000
- [c35]Byoung-Tak Zhang, Gerhard Paass, Heinz Mühlenbein:
Convergence properties of incremental Bayesian evolutionary algorithms with single Markov chains. CEC 2000: 938-945 - [c34]Heinz Mühlenbein, Jörg Zimmermann:
Size of neighborhood more important than temperature for stochastic local search. CEC 2000: 1017-1024 - [c33]Carlos Alberto Ochoa Ortíz Zezzatti, Heinz Mühlenbein, Marta Soto:
A Factorized Distribution Algorithm Using Single Connected Bayesian Networks. PPSN 2000: 787-796 - 1999
- [c32]Heinz Mühlenbein, Thilo Mahnig:
The Factorized Distribution Algorithm for additively decomposed functions. CEC 1999: 752-759 - 1998
- [c31]Christine Crisan, Heinz Mühlenbein:
The Breeder Genetic Algorithm for Frequency Assignment. PPSN 1998: 897-906 - 1997
- [c30]Christine Crisan, Heinz Mühlenbein:
The Frequency Assignment Problem: A Look at the Performance of Evolutionary Search. Artificial Evolution 1997: 263-274 - [c29]Ulrich Bartling, Heinz Mühlenbein:
Optimization of Large Scale Parcel Distribution Systems by the Breeder Genetic Algorithm (BGA). ICGA 1997: 473-480 - 1996
- [c28]Dirk Schlierkamp-Voosen, Heinz Mühlenbein:
Adaptation of Population Sizes by Competing Subpopulations. International Conference on Evolutionary Computation 1996: 330-335 - [c27]Hans-Michael Voigt, Heinz Mühlenbein, Dirk Schlierkamp-Voosen:
The Response to Selection Equation for Skew Fitness Distributions. International Conference on Evolutionary Computation 1996: 820-825 - [c26]Heinz Mühlenbein, Gerhard Paass:
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. PPSN 1996: 178-187 - [c25]Heinz Mühlenbein, Jürgen Bendisch, Hans-Michael Voigt:
From Recombination of Genes to the Estimation of Distributions II. Continuous Parameters. PPSN 1996: 188-197 - [c24]Hans-Michael Voigt, Heinz Mühlenbein:
Erroneous Truncation Selection - A Breeder's Decision Making Perspective. PPSN 1996: 276-285 - 1995
- [c23]Heinz Mühlenbein, Dirk Schlierkamp-Voosen:
Analysis of Selection, Mutation and Recombination in Genetic Algorithms. Evolution and Biocomputation 1995: 142-168 - [c22]Hans-Michael Voigt, Heinz Mühlenbein, Dragan Cvetkovic:
Fuzzy Recombination for the Breeder Genetic Algorithm. ICGA 1995: 104-113 - 1994
- [c21]Byoung-Tak Zhang, Heinz Mühlenbein:
Synthesis of Sigma-Pi Neural Networks by the Breeder Genetic Programming. International Conference on Evolutionary Computation 1994: 318-323 - [c20]Hideki Asoh, Heinz Mühlenbein:
On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation. PPSN 1994: 88-97 - [c19]Hideki Asoh, Heinz Mühlenbein:
Estimating the Heritability by Decomposing the Genetic Variance. PPSN 1994: 98-107 - [c18]Dirk Schlierkamp-Voosen, Heinz Mühlenbein:
Strategy Adaption by Competing Subpopulations. PPSN 1994: 199-208 - 1993
- [c17]Byoung-Tak Zhang, Heinz Mühlenbein:
Genetic Programming of Minimal Neural Nets Using Occam's Razor. ICGA 1993: 342-351 - [c16]Heinz Mühlenbein, Dirk Schlierkamp-Voosen:
Optimal Interaction of Mutation and Crossover in the Breeder Genetic Algorithm. ICGA 1993: 648 - 1992
- [c15]Heinz Mühlenbein:
How Genetic Algorithms Really Work: Mutation and Hillclimbing. PPSN 1992: 15-26 - 1991
- [c14]Heinz Mühlenbein, M. Schomisch, Joachim Born:
The Parallel Genetic Algorithm as Function Optimizer. ICGA 1991: 271-278 - [c13]Heinz Mühlenbein:
Parallel Genetic Algorithms in Optimization. Physik und Informatik 1991: 2-15 - [c12]Heinz Mühlenbein:
Asynchronous parallel search by the parallel genetic algorithm. SPDP 1991: 526-533 - 1990
- [c11]Heinz Mühlenbein:
Evolution in Time and Space - The Parallel Genetic Algorithm. FOGA 1990: 316-337 - [c10]Gregor von Laszewski, Heinz Mühlenbein:
Partitioning a Graph with a Parallel Genetic Algorithm. PPSN 1990: 165-169 - 1989
- [c9]Heinz Mühlenbein:
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization. ICGA 1989: 416-421 - [c8]Heinz Mühlenbein:
Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization. Parallelism, Learning, Evolution 1989: 398-406 - 1987
- [c7]Heinz Mühlenbein, Ottmar Krämer, F. Limburger, Monika Mevenkamp, Siegfried Streitz:
Design and Rationale for MUPPET: A Programming Environment for Message Based Multiprocessors. ICS 1987: 172-193 - [c6]Ottmar Krämer, Heinz Mühlenbein:
Mapping Strategies in Message Based Multiprocessor Systems. PARLE (1) 1987: 213-225 - 1986
- [c5]Heinz Mühlenbein, F. Limburger, Siegfried Streitz, S. Warhaut:
MUPPET - A Programming Environment of Message-Based Multiprocessors. FJCC 1986: 336-343 - 1985
- [c4]Heinz Mühlenbein, S. Warhaut:
Concurrent Mulitgrid Methods in an Object-Oriented Environment: A Case Study. ICPP 1985: 143-146 - 1981
- [c3]Heinz Mühlenbein:
TOCS: A SIMULA-Based Simulator for the Analysis of Mainframe-Oriented Distributed Systems. ECI 1981: 321-333 - [c2]Heinz Mühlenbein:
Modellierung des Paging-Verhaltens im Teilnehmerbetrieb. MMB 1981: 249-262 - 1977
- [c1]Heinz Mühlenbein:
Ein Vorschlag zur Leistungsbeschreibung von Interaktiven DV-Systemen. GI-Fachgespräch über Rechenzentren 1977: 213-232
Parts in Books or Collections
- 2007
- [p3]Sanghamitra Bandyopadhyay, Santanu Santra, Ujjwal Maulik, Heinz Mühlenbein:
In Silico Design of Ligands Using Properties of Target Active Sites. Analysis of Biological Data: A Soft Computing Approach 2007: 183-201 - 2006
- [p2]Heinz Mühlenbein, Robin Höns:
The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. Scalable Optimization via Probabilistic Modeling 2006: 11-37 - 1992
- [p1]Heinz Mühlenbein:
Parallel Genetic Algorithms in Combinatorial Optimization. Computer Science and Operations Research 1992: 441-453
Informal and Other Publications
- 2006
- [i3]Heinz Mühlenbein, Robin Höns:
The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. Theory of Evolutionary Algorithms 2006 - 2002
- [i2]Frank Schweitzer, Laxmidhar Behera, Heinz Mühlenbein:
Evolution of Cooperation in a Spatial Prisoner's Dilemma. CoRR cond-mat/0211605 (2002) - 2001
- [i1]Frank Schweitzer, Jörg Zimmermann, Heinz Mühlenbein:
Coordination of Decisions in a Spatial Agent Model. CoRR cond-mat/0109121 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
