Form invariance and implicit parallelism

被引:13
作者
Vose, MD
Wright, AH
机构
[1] Univ Tennessee, Dept Comp Sci, Knoxville, TN 37996 USA
[2] Univ Montana, Dept Comp Sci, Missoula, MT 59812 USA
关键词
course graining; form invariance; genetic algorithms; implicit parallelism; intrinsic parallelism; mixing scheme; schemata;
D O I
10.1162/106365601750406037
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Holland's schema theorem (an inequality) may be viewed as an attempt to understand genetic search in terms of a coarse graining of the state space, Stephens and Waelbroeck developed that perspective, sharpening the schema theorem to an equality, Of particular interest is a "form invariance" of their equations; the form is unchanged by the degree of coarse graining. This paper establishes a similar form invariance for the more general model of Vose et al. and uses the attendant machinery as a springboard for an interpretation and discussion of implicit parallelism.
引用
收藏
页码:355 / 370
页数:16
相关论文
共 16 条
[1]  
[Anonymous], P 7 INT C GEN ALG E
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
[Anonymous], SIMPLE GENETIC ALGOR
[4]  
BRIDGES CL, 1987, P 2 INT C GEN ALG, P9
[5]  
HOLLAND JH, 1975, ADAPTATION NATURAL A
[6]   The Genetic Algorithm Fractal [J].
Juliany, Jenny ;
Vose, Michael D. .
EVOLUTIONARY COMPUTATION, 1994, 2 (02) :165-180
[7]   General Cardinality Genetic Algorithms [J].
Koehler, Gary J. ;
Bhattacharyya, Siddhartha ;
Vose, Michael D. .
EVOLUTIONARY COMPUTATION, 1997, 5 (04) :439-459
[8]  
STEPHENS CR, 1999, FDN GENETIC ALGORITH, V5, P117
[9]   Random heuristic search: applications to GAs and functions of unitation [J].
Vose, MD ;
Rowe, JE .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :195-220
[10]  
VOSE MD, 1998, CS98402 U TENN