Abstract | ||
---|---|---|
Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, ranking selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. A number of results concerning "form invariance" are given. Within the context of GAs, the primary contribution made is the illustration of a technique by which coarse grainings may be analyzed. It is applied to obtain a number of new coarse graining results. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1016/j.tcs.2006.04.007 | Theor. Comput. Sci. |
Keywords | Field | DocType |
new coarse graining result,differentiable coarse graining,commutative diagram,differentiable case,coarse graining,nonlinear coarse graining,binary tournament selection,form invariance,ranking selection,coarse grainings,proportional selection,mutation,linear coarse grainings,selection,differentiable | Population,Combinatorics,Commutative diagram,Nonlinear system,Invariant (physics),Differentiable function,Granularity,Tournament selection,Genetic algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
361 | 1 | Theoretical Computer Science |
Citations | PageRank | References |
5 | 0.61 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jonathan E. Rowe | 1 | 458 | 56.35 |
Michael D. Vose | 2 | 752 | 215.67 |
Alden H. Wright | 3 | 330 | 45.58 |