dbo:abstract
|
- 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)
- 在遺傳演算法和遺傳編程裡面,定義長度(defining length) L(H) 是指在一個"H"裡面,兩個定義符號(defining symbol)最遠的距離 (這裡的定義符號是指有一個固定值的符號, 對應有一些符號—— 一般以#或*表示 ——可以代表任意值) 。在樹GP(tree GP,GP代表遺傳演算法)架構裡面, L(H)則是在架構H裡面,包含所有不是"="的符號,最小樹片段的連接數。 (zh)
|
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 1166 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dcterms:subject
| |
gold:hypernym
| |
rdf:type
| |
rdfs:comment
|
- 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)
- 在遺傳演算法和遺傳編程裡面,定義長度(defining length) L(H) 是指在一個"H"裡面,兩個定義符號(defining symbol)最遠的距離 (這裡的定義符號是指有一個固定值的符號, 對應有一些符號—— 一般以#或*表示 ——可以代表任意值) 。在樹GP(tree GP,GP代表遺傳演算法)架構裡面, L(H)則是在架構H裡面,包含所有不是"="的符號,最小樹片段的連接數。 (zh)
|
rdfs:label
|
- Defining length (en)
- 定義長度 (zh)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:wikiPageRedirects
of | |
is dbo:wikiPageWikiLink
of | |
is foaf:primaryTopic
of | |