Name
Abstract | ||
|---|---|---|
In many applications of genetic algorithms, there is a tradeoff between speed and accuracy in fitness evaluations when evaluations are relaxed from using numerical methods such as numerical integration. In these types of applications, the cost and accuracy vary from discretization errors when implicit or explicit quadrature is used to estimate the function evaluations. There may be several functions with different grid sizing to obtain a given solution quality. This thesis examines... |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1162/1063656054794752 | Evolutionary Computation |
Keywords | DocType | Volume |
discretization,speedup,genetic algorithms | Journal | 13 |
Issue | ISSN | Citations |
3 | 1063-6560 | 4 |
PageRank | References | Authors |
0.51 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laura A. Mclay | 1 | 192 | 15.16 |
| David E. Goldberg | 2 | 5790 | 940.53 |