. . . "844376579"^^ . . . . "\u5728\u907A\u50B3\u6F14\u7B97\u6CD5\u548C\u907A\u50B3\u7DE8\u7A0B\u88E1\u9762\uFF0C\u5B9A\u7FA9\u9577\u5EA6(defining length) L(H) \u662F\u6307\u5728\u4E00\u500B\"H\"\u88E1\u9762\uFF0C\u5169\u500B\u5B9A\u7FA9\u7B26\u865F(defining symbol)\u6700\u9060\u7684\u8DDD\u96E2 (\u9019\u88E1\u7684\u5B9A\u7FA9\u7B26\u865F\u662F\u6307\u6709\u4E00\u500B\u56FA\u5B9A\u503C\u7684\u7B26\u865F\uFF0C \u5C0D\u61C9\u6709\u4E00\u4E9B\u7B26\u865F\u2014\u2014 \u4E00\u822C\u4EE5#\u6216*\u8868\u793A \u2014\u2014\u53EF\u4EE5\u4EE3\u8868\u4EFB\u610F\u503C) \u3002\u5728\u6A39GP(tree GP\uFF0CGP\u4EE3\u8868\u907A\u50B3\u6F14\u7B97\u6CD5)\u67B6\u69CB\u88E1\u9762, L(H)\u5247\u662F\u5728\u67B6\u69CBH\u88E1\u9762\uFF0C\u5305\u542B\u6240\u6709\u4E0D\u662F\"=\"\u7684\u7B26\u865F\uFF0C\u6700\u5C0F\u6A39\u7247\u6BB5\u7684\u9023\u63A5\u6578\u3002"@zh . . . "In genetic algorithms and genetic programming defining length 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 schema 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."@en . . "1166"^^ . "1514171"^^ . . . . . . . "\u5728\u907A\u50B3\u6F14\u7B97\u6CD5\u548C\u907A\u50B3\u7DE8\u7A0B\u88E1\u9762\uFF0C\u5B9A\u7FA9\u9577\u5EA6(defining length) L(H) \u662F\u6307\u5728\u4E00\u500B\"H\"\u88E1\u9762\uFF0C\u5169\u500B\u5B9A\u7FA9\u7B26\u865F(defining symbol)\u6700\u9060\u7684\u8DDD\u96E2 (\u9019\u88E1\u7684\u5B9A\u7FA9\u7B26\u865F\u662F\u6307\u6709\u4E00\u500B\u56FA\u5B9A\u503C\u7684\u7B26\u865F\uFF0C \u5C0D\u61C9\u6709\u4E00\u4E9B\u7B26\u865F\u2014\u2014 \u4E00\u822C\u4EE5#\u6216*\u8868\u793A \u2014\u2014\u53EF\u4EE5\u4EE3\u8868\u4EFB\u610F\u503C) \u3002\u5728\u6A39GP(tree GP\uFF0CGP\u4EE3\u8868\u907A\u50B3\u6F14\u7B97\u6CD5)\u67B6\u69CB\u88E1\u9762, L(H)\u5247\u662F\u5728\u67B6\u69CBH\u88E1\u9762\uFF0C\u5305\u542B\u6240\u6709\u4E0D\u662F\"=\"\u7684\u7B26\u865F\uFF0C\u6700\u5C0F\u6A39\u7247\u6BB5\u7684\u9023\u63A5\u6578\u3002"@zh . . . . "Defining length"@en . "In genetic algorithms and genetic programming defining length 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 schema 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."@en . . . . . . . . . . . . . "\u5B9A\u7FA9\u9577\u5EA6"@zh .