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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F06%3A03120031%21RIV07-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A03120031%21RIV07-MSM-21230___
rdf:type
skos:Concept n12:Vysledek
dcterms:description
In this paper, we introduce a new framework called Iterative Prototype Optimisation with Evolved Improvement Steps. This is a general optimisation framework, where an initial prototype solution is being improved iteration by iteration. In each iteration, a sequence of actions/operations, which improves the current prototype the most, is found by an evolutionary algorithm. The proposed algorithm has been tested on problems from two different optimisation problem domains - binary string optimisation and the traveling salesman problem. In this paper, we introduce a new framework called Iterative Prototype Optimisation with Evolved Improvement Steps. This is a general optimisation framework, where an initial prototype solution is being improved iteration by iteration. In each iteration, a sequence of actions/operations, which improves the current prototype the most, is found by an evolutionary algorithm. The proposed algorithm has been tested on problems from two different optimisation problem domains - binary string optimisation and the traveling salesman problem. Není k dispozici
dcterms:title
Iterative Prototype Optimisation with Evolved Improvement Steps Iterative Prototype Optimisation with Evolved Improvement Steps Není k dispozici
skos:prefLabel
Není k dispozici Iterative Prototype Optimisation with Evolved Improvement Steps Iterative Prototype Optimisation with Evolved Improvement Steps
skos:notation
RIV/68407700:21230/06:03120031!RIV07-MSM-21230___
n3:strany
154 ; 165
n3:aktivita
n9:Z
n3:aktivity
Z(MSM6840770012)
n3:dodaniDat
n14:2007
n3:domaciTvurceVysledku
n4:7341520 n4:1775022
n3:druhVysledku
n15:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
480565
n3:idVysledku
RIV/68407700:21230/06:03120031
n3:jazykVysledku
n13:eng
n3:klicovaSlova
POEMS; evolutionary algorithms; genetic algorithm
n3:klicoveSlovo
n10:genetic%20algorithm n10:evolutionary%20algorithms n10:POEMS
n3:kontrolniKodProRIV
[53FD556968FA]
n3:mistoKonaniAkce
Budapest
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Genetic Programming, Proceedings of 9th European Conference, EuroGP 2006
n3:obor
n11:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n14:2006
n3:tvurceVysledku
Kubalík, Jiří Faigl, Jan
n3:typAkce
n16:WRD
n3:zahajeniAkce
2006-04-10+02:00
n3:zamer
n17:MSM6840770012
s:numberOfPages
12
n20:hasPublisher
Springer-Verlag
n19:isbn
3-540-33143-3
n8:organizacniJednotka
21230