This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-zhhttp://zh.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Defining_length
rdf:type
yago:PsychologicalFeature100023100 yago:Algorithm105847438 yago:Act100030358 yago:Activity100407535 yago:Procedure101023820 yago:Event100029378 dbo:Agent yago:YagoPermanentlyLocatedEntity yago:Abstraction100002137 yago:Rule105846932 yago:WikicatGeneticAlgorithms
rdfs:label
Defining length 定義長度
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. 在遺傳演算法和遺傳編程裡面，定義長度(defining length) L(H) 是指在一個"H"裡面，兩個定義符號(defining symbol)最遠的距離 (這裡的定義符號是指有一個固定值的符號， 對應有一些符號—— 一般以#或*表示 ——可以代表任意值) 。在樹GP(tree GP，GP代表遺傳演算法)架構裡面, L(H)則是在架構H裡面，包含所有不是"="的符號，最小樹片段的連接數。
dcterms:subject
dbc:Genetic_algorithms
dbo:wikiPageID
1514171
dbo:wikiPageRevisionID
844376579
dbo:wikiPageWikiLink
dbr:Schema_(genetic_algorithms) dbr:Genetic_algorithms dbr:Genetic_programming dbr:Mutation dbr:Crossover_(genetic_algorithm) dbc:Genetic_algorithms
owl:sameAs
wikidata:Q5251583 dbpedia-zh:定義長度 freebase:m.0574hk yago-res:Defining_length n17:4iyjN
dbp:wikiPageUsesTemplate
dbt:Comp-sci-stub dbt:Reflist dbt:Use_dmy_dates dbt:Technical
dbo:abstract
在遺傳演算法和遺傳編程裡面，定義長度(defining length) L(H) 是指在一個"H"裡面，兩個定義符號(defining symbol)最遠的距離 (這裡的定義符號是指有一個固定值的符號， 對應有一些符號—— 一般以#或*表示 ——可以代表任意值) 。在樹GP(tree GP，GP代表遺傳演算法)架構裡面, L(H)則是在架構H裡面，包含所有不是"="的符號，最小樹片段的連接數。 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.
gold:hypernym
dbr:Distance
prov:wasDerivedFrom
wikipedia-en:Defining_length?oldid=844376579&ns=0
dbo:wikiPageLength
1166
foaf:isPrimaryTopicOf
wikipedia-en:Defining_length