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
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n14http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F09%3A00157263%21RIV10-MSM-21230___/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n6http://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/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F09%3A00157263%21RIV10-MSM-21230___
rdf:type
skos:Concept n12:Vysledek
dcterms:description
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during the optimization. Furthermore, all the sampled points are considered when deciding where to sample next. The results suggest that the algorithm is a viable alternative only for low dimensional search spaces (5D at most). The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during the optimization. Furthermore, all the sampled points are considered when deciding where to sample next. The results suggest that the algorithm is a viable alternative only for low dimensional search spaces (5D at most).
dcterms:title
BBOB benchmarking the DIRECT global optimization algorithm BBOB benchmarking the DIRECT global optimization algorithm
skos:prefLabel
BBOB benchmarking the DIRECT global optimization algorithm BBOB benchmarking the DIRECT global optimization algorithm
skos:notation
RIV/68407700:21230/09:00157263!RIV10-MSM-21230___
n3:aktivita
n8:Z
n3:aktivity
Z(MSM6840770012)
n3:dodaniDat
n5:2010
n3:domaciTvurceVysledku
n11:2312883
n3:druhVysledku
n17:D
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
304772
n3:idVysledku
RIV/68407700:21230/09:00157263
n3:jazykVysledku
n15:eng
n3:klicovaSlova
optimization; evolutionary computation; benchmarking; direct
n3:klicoveSlovo
n9:direct n9:evolutionary%20computation n9:optimization n9:benchmarking
n3:kontrolniKodProRIV
[8DE2CC6FE175]
n3:mistoKonaniAkce
Montreal
n3:mistoVydani
New York
n3:nazevZdroje
Genetic and Evolutionary Computation Conference 2009
n3:obor
n13:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n5:2009
n3:tvurceVysledku
Pošík, Petr
n3:typAkce
n21:WRD
n3:zahajeniAkce
2009-07-08+02:00
n3:zamer
n6:MSM6840770012
s:numberOfPages
6
n14:hasPublisher
ACM
n18:isbn
978-1-60558-325-9
n10:organizacniJednotka
21230