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

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

Namespace Prefixes

PrefixIRI
n11https://www.springer.com/business/operations+research/book/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n5http://dbpedia.org/resource/File:
n13http://atarazanas.sci.uma.es/docs/tesisuma/
n23https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
n21http://www.lcc.uma.es/~eat/pdf/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n6https://www.researchgate.net/profile/Andrea_Tettamanzi/publication/3418844_Selection_Intensity_in_Cellular_Evolutionary_Algorithms_for_Regular_Lattices/links/00463525c395463b1b000000/
freebasehttp://rdf.freebase.com/ns/
n14http://atarazanas.sci.uma.es/docs/articulos/
n16http://
n17http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
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#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n25http://neo.lcc.uma.es/cEA-web/

Statements

Subject Item
dbr:Cellular_evolutionary_algorithm
rdf:type
yago:Algorithm105847438 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Abstraction100002137 yago:WikicatEvolutionaryAlgorithms yago:Act100030358 yago:Procedure101023820 yago:Activity100407535 yago:Rule105846932 yago:Event100029378
rdfs:label
Cellular evolutionary algorithm
rdfs:comment
A cellular evolutionary algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts with its closer neighbors on which a basic EA is applied (selection, variation, replacement).
foaf:depiction
n17:Evolution_of_several_cEAs.png n17:Ratio_concept_in_cEAs.png n17:CEA_neighborhood_types.png
dcterms:subject
dbc:Evolutionary_algorithms
dbo:wikiPageID
33418313
dbo:wikiPageRevisionID
1093000327
dbo:wikiPageWikiLink
n5:Evolution_of_several_cEAs.png dbr:Metaheuristic dbr:FPGAs n5:CEA_neighborhood_types.png dbr:Cellular_automata dbr:Dual-phase_evolution n5:Ratio_concept_in_cEAs.png dbr:Parallel_metaheuristics dbr:Enrique_Alba dbc:Evolutionary_algorithms dbr:Parallel_metaheuristic dbr:GPUs dbr:Evolutionary_algorithm dbr:Cellular_automaton
dbo:wikiPageExternalLink
n6:Selection-Intensity-in-Cellular-Evolutionary-Algorithms-for-Regular-Lattices.pdf n11:978-0-387-77609-5 n13:1661480x.pdf n14:16603096.pdf n16:neo.lcc.uma.es n21:comcom07.pdf n25:
owl:sameAs
freebase:m.0h95zwm yago-res:Cellular_evolutionary_algorithm n23:4geak wikidata:Q5058361
dbp:wikiPageUsesTemplate
dbt:Evolutionary_computation dbt:Short_description dbt:Reflist dbt:ISBN
dbo:thumbnail
n17:Evolution_of_several_cEAs.png?width=300
dbo:abstract
A cellular evolutionary algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts with its closer neighbors on which a basic EA is applied (selection, variation, replacement). The cellular model simulates natural evolution from the point of view ofthe individual, which encodes a tentative (optimization, learning, search) problem solution. The essential idea of this model is to provide the EA populationwith a special structure defined as a connected graph, in which each vertex is an individual who communicates with hisnearest neighbors. Particularly, individuals are conceptually set in a toroidalmesh, and are only allowed to recombine with close individuals. This leads usto a kind of locality known as isolation by distance. The set of potential matesof an individual is called its neighborhood. It is known that, in this kindof algorithm, similar individuals tend to cluster creating niches, and these groupsoperate as if they were separate sub-populations (islands). Anyway, there is noclear borderline between adjacent groups, and close niches could be easilycolonized by competitive niches and maybe merge solution contents during the process. Simultaneously,farther niches can be affected more slowly.
gold:hypernym
dbr:Kind
prov:wasDerivedFrom
wikipedia-en:Cellular_evolutionary_algorithm?oldid=1093000327&ns=0
dbo:wikiPageLength
9469
foaf:isPrimaryTopicOf
wikipedia-en:Cellular_evolutionary_algorithm
Subject Item
dbr:Outline_of_machine_learning
dbo:wikiPageWikiLink
dbr:Cellular_evolutionary_algorithm
Subject Item
dbr:Cellular_Evolutionary_Algorithms
dbo:wikiPageWikiLink
dbr:Cellular_evolutionary_algorithm
dbo:wikiPageRedirects
dbr:Cellular_evolutionary_algorithm
Subject Item
dbr:Cellular_evolutionary_algorithms
dbo:wikiPageWikiLink
dbr:Cellular_evolutionary_algorithm
dbo:wikiPageRedirects
dbr:Cellular_evolutionary_algorithm
Subject Item
dbr:Cellular_genetic_algorithm
dbo:wikiPageWikiLink
dbr:Cellular_evolutionary_algorithm
dbo:wikiPageRedirects
dbr:Cellular_evolutionary_algorithm
Subject Item
wikipedia-en:Cellular_evolutionary_algorithm
foaf:primaryTopic
dbr:Cellular_evolutionary_algorithm