Knowledge

Defining length

Source 📝

155: 22: 94:
Schemata "00##0", "1###1", "01###", and "##0##" have defining lengths of 4, 4, 1, and 0, respectively. Lengths are computed by determining the last fixed position and subtracting from it the first fixed position.
82:
L(H) is the maximum distance between two defining symbols (that is symbols that have a fixed value as opposed to symbols that can take any value, commonly denoted as # or *) in
40: 196: 86:
H. In tree GP schemata, L(H) is the number of links in the minimum tree fragment including all the non-= symbols within a schema H.
58: 220: 107: 215: 189: 83: 102:
as the defining length of a solution increases so does the susceptibility of the solution to disruption due to
182: 76: 99: 72: 162: 166: 209: 127: 154: 103: 15: 170: 36: 31:
may be too technical for most readers to understand
190: 8: 197: 183: 59:Learn how and when to remove this message 43:, without removing the technical details. 119: 41:make it understandable to non-experts 7: 151: 149: 128:"Foundations of Genetic Programming" 14: 153: 20: 1: 169:. You can help Knowledge by 237: 148: 221:Computer science stubs 77:genetic programming 216:Genetic algorithms 100:genetic algorithms 73:genetic algorithms 178: 177: 69: 68: 61: 228: 199: 192: 185: 163:computer science 157: 150: 140: 139: 137: 135: 124: 64: 57: 53: 50: 44: 24: 23: 16: 236: 235: 231: 230: 229: 227: 226: 225: 206: 205: 204: 203: 146: 144: 143: 133: 131: 126: 125: 121: 116: 92: 80:defining length 65: 54: 48: 45: 37:help improve it 34: 25: 21: 12: 11: 5: 234: 232: 224: 223: 218: 208: 207: 202: 201: 194: 187: 179: 176: 175: 158: 142: 141: 118: 117: 115: 112: 91: 88: 67: 66: 28: 26: 19: 13: 10: 9: 6: 4: 3: 2: 233: 222: 219: 217: 214: 213: 211: 200: 195: 193: 188: 186: 181: 180: 174: 172: 168: 165:article is a 164: 159: 156: 152: 147: 129: 123: 120: 113: 111: 109: 105: 101: 96: 89: 87: 85: 81: 78: 74: 63: 60: 52: 42: 38: 32: 29:This article 27: 18: 17: 171:expanding it 160: 145: 132:. Retrieved 122: 97: 93: 79: 70: 55: 46: 30: 49:August 2011 210:Categories 114:References 108:cross-over 130:. UCL UK 104:mutation 134:13 July 90:Example 35:Please 84:schema 161:This 167:stub 136:2010 75:and 106:or 98:In 71:In 39:to 212:: 110:. 198:e 191:t 184:v 173:. 138:. 62:) 56:( 51:) 47:( 33:.

Index

help improve it
make it understandable to non-experts
Learn how and when to remove this message
genetic algorithms
genetic programming
schema
genetic algorithms
mutation
cross-over
"Foundations of Genetic Programming"
Stub icon
computer science
stub
expanding it
v
t
e
Categories
Genetic algorithms
Computer science stubs

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.