This HTML5 document contains 40 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/
n12http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/subjekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10105978%21RIV12-GA0-11320___/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10105978%21RIV12-GA0-11320___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
Abstract. Evolutionary algorithms generally require a large number of objec- tive function evaluations which can be costly in practice. These evaluations can be replaced by evaluations of a cheaper meta-model of the objective functions. In this paper we describe a multiobjective memetic algorithm utilizing local distance based meta-models. This algorithm is evaluated and compared to standard multiobjective evolutionary algorithms as well as a similar algorithm with a global meta-model. The number of objective function evaluations is considered, and also the conditions under which the algorithm actually helps to reduce the time needed to find a solution are analyzed. Abstract. Evolutionary algorithms generally require a large number of objec- tive function evaluations which can be costly in practice. These evaluations can be replaced by evaluations of a cheaper meta-model of the objective functions. In this paper we describe a multiobjective memetic algorithm utilizing local distance based meta-models. This algorithm is evaluated and compared to standard multiobjective evolutionary algorithms as well as a similar algorithm with a global meta-model. The number of objective function evaluations is considered, and also the conditions under which the algorithm actually helps to reduce the time needed to find a solution are analyzed.
dcterms:title
Local Meta-models for ASM-MOMA Local Meta-models for ASM-MOMA
skos:prefLabel
Local Meta-models for ASM-MOMA Local Meta-models for ASM-MOMA
skos:notation
RIV/00216208:11320/11:10105978!RIV12-GA0-11320___
n13:predkladatel
n14:orjk%3A11320
n3:aktivita
n4:P
n3:aktivity
P(GD201/09/H057)
n3:cisloPeriodika
6838
n3:dodaniDat
n11:2012
n3:domaciTvurceVysledku
n19:2542250
n3:druhVysledku
n7:J
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
209801
n3:idVysledku
RIV/00216208:11320/11:10105978
n3:jazykVysledku
n17:eng
n3:klicovaSlova
evolutionary algorithm; surrogate models; meta-models; multiobjective optimization
n3:klicoveSlovo
n5:meta-models n5:multiobjective%20optimization n5:evolutionary%20algorithm n5:surrogate%20models
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[17412BDB7B36]
n3:nazevZdroje
Lecture Notes in Computer Science
n3:obor
n15:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n18:GD201%2F09%2FH057
n3:rokUplatneniVysledku
n11:2011
n3:svazekPeriodika
Neuveden
n3:tvurceVysledku
Neruda, Roman Pilát, Martin
s:issn
0302-9743
s:numberOfPages
6
n12:organizacniJednotka
11320