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

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

Namespace Prefixes

PrefixIRI
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n16http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n22http://linked.opendata.cz/resource/domain/vavai/subjekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
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/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21110%2F12%3A00193911%21RIV13-GA0-21110___/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21110%2F12%3A00193911%21RIV13-GA0-21110___
rdf:type
n17:Vysledek skos:Concept
rdfs:seeAlso
http://www.engmech.cz/2012/proceedings/pdf/230_Pospisilova_A-FT.pdf
dcterms:description
This contribution focuses on searching for global optima of size optimization benchmarks utilizing a method based on branch and bound principles. The goal is to show the process of finding these global optima on several examples. To minimize computational demands a suitable parallelization is used. Optima which can be found in available literature and optima obtained in this work are compared. This contribution focuses on searching for global optima of size optimization benchmarks utilizing a method based on branch and bound principles. The goal is to show the process of finding these global optima on several examples. To minimize computational demands a suitable parallelization is used. Optima which can be found in available literature and optima obtained in this work are compared.
dcterms:title
Branch and Bound Method for Global Optima of Size Optimization Benchmarks Branch and Bound Method for Global Optima of Size Optimization Benchmarks
skos:prefLabel
Branch and Bound Method for Global Optima of Size Optimization Benchmarks Branch and Bound Method for Global Optima of Size Optimization Benchmarks
skos:notation
RIV/68407700:21110/12:00193911!RIV13-GA0-21110___
n17:predkladatel
n22:orjk%3A21110
n3:aktivita
n12:S n12:P
n3:aktivity
P(GAP105/12/1146), S
n3:dodaniDat
n6:2013
n3:domaciTvurceVysledku
n14:9081429 n14:1476602
n3:druhVysledku
n9:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
125471
n3:idVysledku
RIV/68407700:21110/12:00193911
n3:jazykVysledku
n4:eng
n3:klicovaSlova
benchmarks; discrete sizing optimization; branch and bound method; global optima; parallel programming
n3:klicoveSlovo
n5:global%20optima n5:benchmarks n5:parallel%20programming n5:discrete%20sizing%20optimization n5:branch%20and%20bound%20method
n3:kontrolniKodProRIV
[9DC99F03B0FA]
n3:mistoKonaniAkce
Svratka
n3:mistoVydani
Prague
n3:nazevZdroje
Engineering Mechanics 2012
n3:obor
n8:JM
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n10:GAP105%2F12%2F1146
n3:rokUplatneniVysledku
n6:2012
n3:tvurceVysledku
Lepš, Matěj Pospíšilová, Adéla
n3:typAkce
n19:WRD
n3:zahajeniAkce
2012-05-14+02:00
s:numberOfPages
11
n16:hasPublisher
Ústav teoretické a aplikované mechaniky AV ČR
n21:isbn
978-80-86246-40-6
n18:organizacniJednotka
21110