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
n6http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n18http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
n7https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F60162694%3AG43__%2F10%3A00426552%21RIV11-MO0-G43_____/
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/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F60162694%3AG43__%2F10%3A00426552%21RIV11-MO0-G43_____
rdf:type
skos:Concept n11:Vysledek
dcterms:description
In stochastic process we are often using different algorithms for subproblem solution. It is very hard to decide with one is best (anyway the decision depends on stage of problem solution). This problem can be solved via adaptive algorithms. This paper will show the data structure for C# language on platform .NET with example where the adaptive algorithm was used. In stochastic process we are often using different algorithms for subproblem solution. It is very hard to decide with one is best (anyway the decision depends on stage of problem solution). This problem can be solved via adaptive algorithms. This paper will show the data structure for C# language on platform .NET with example where the adaptive algorithm was used.
dcterms:title
Procedure set – data structure for adaptive algorithm Procedure set – data structure for adaptive algorithm
skos:prefLabel
Procedure set – data structure for adaptive algorithm Procedure set – data structure for adaptive algorithm
skos:notation
RIV/60162694:G43__/10:00426552!RIV11-MO0-G43_____
n3:aktivita
n15:Z
n3:aktivity
Z(MO0FVT0000403)
n3:dodaniDat
n4:2011
n3:domaciTvurceVysledku
n9:7925727 n9:8291829
n3:druhVysledku
n8:D
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
282372
n3:idVysledku
RIV/60162694:G43__/10:00426552
n3:jazykVysledku
n20:eng
n3:klicovaSlova
Adaptive algorithm; genetic programming
n3:klicoveSlovo
n10:genetic%20programming n10:Adaptive%20algorithm
n3:kontrolniKodProRIV
[E4710ABB28B2]
n3:mistoKonaniAkce
Bratislava
n3:mistoVydani
Bratislava
n3:nazevZdroje
ICMT'10 Proceedings
n3:obor
n17:KA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n4:2010
n3:tvurceVysledku
Štefek, Alexandr Krupka, Zdeněk
n3:typAkce
n6:EUR
n3:zahajeniAkce
2010-01-01+01:00
n3:zamer
n12:MO0FVT0000403
s:numberOfPages
5
n18:hasPublisher
Neuveden
n7:isbn
978-80-8075-453-2
n21:organizacniJednotka
G43