2000
DOI: 10.1007/978-3-642-57137-4
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionäre Algorithmen

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2003
2003
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…Here only a brief summary of the genetic optimisation process is given. A more detailed description can be found in [24] and [25].…”
Section: Pre-design Toolmentioning
confidence: 99%
“…Here only a brief summary of the genetic optimisation process is given. A more detailed description can be found in [24] and [25].…”
Section: Pre-design Toolmentioning
confidence: 99%
“…In order to assist with the choice of network parameters, a Genetic Algorithm (GA) has been employed to automatically investigate the parameter space for network creation (similar to the approaches in [23], [24]). For this sake, a GA Toolbox for MATLAB [19] has been used. The input values for the GA are the number of neurons in the hidden layers and the size of the training set.…”
Section: Ann Trainingmentioning
confidence: 99%
“…Therefore, efficient search algorithms are needed, which probably makes use of chemical intuition to lower the search time. Various different optimization methods have been developed like Monte Carlo (MC), molecular dynamics (MD), and genetic algorithms (GAs) . Recently, a new algorithm has been proposed .…”
Section: Introductionmentioning
confidence: 99%