This HTML5 document contains 47 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/
n13http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26110%2F05%3APU58257%21RIV08-GA0-26110___/
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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://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/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26110%2F05%3APU58257%21RIV08-GA0-26110___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
Genetické algoritmy se používají pro optimalizaci procesů, kde jiné algoritmy pracují obtížně nebo neefektivně. Do této skupiny úloh patří i skládání segmentů do předem určeného obrazce, jehož tvar je znám. V článku je popsáno jedno z možných řešení pomocí genetického algoritmu vycházející z popisu segmentů řetězcovými kódy. Metody bylo prakticky využito pro tvorbu kartogramů v diplomových pracích na Ústavu geodézie FAST VUT v Brně. Genetic algorithms represent an up-to-date method of process optimization, where other solutions have failed or haven't given any satisfactory results. One of these processes is puzzle solving, where fragments have to be placed into the defined shape in such a way so that no fragment should mutually overlay and the whole shape area will be filled with all of these fragments. A genetic algorithm solving this task including an exact formulation and a definition of the initial conditions based on cluster analysis has been described in this paper. The algorithm efficiency will be tested in diploma works in Institute of Geodesy, Faculty of Civil Engineering, University of Technology, Brno. The results will be used in the application for cartograms creation. Genetic algorithms represent an up-to-date method of process optimization, where other solutions have failed or haven't given any satisfactory results. One of these processes is puzzle solving, where fragments have to be placed into the defined shape in such a way so that no fragment should mutually overlay and the whole shape area will be filled with all of these fragments. A genetic algorithm solving this task including an exact formulation and a definition of the initial conditions based on cluster analysis has been described in this paper. The algorithm efficiency will be tested in diploma works in Institute of Geodesy, Faculty of Civil Engineering, University of Technology, Brno. The results will be used in the application for cartograms creation.
dcterms:title
A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY Genetický algoritmus pro skládání celku ze seg mentů
skos:prefLabel
A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY A GENETIC ALGORITHM HOW TO SOLVE A PUZZLE AND ITS USING IN CARTOGRAPHY Genetický algoritmus pro skládání celku ze seg mentů
skos:notation
RIV/00216305:26110/05:PU58257!RIV08-GA0-26110___
n3:strany
15-23
n3:aktivita
n10:P
n3:aktivity
P(GA102/04/0469)
n3:cisloPeriodika
4 (2)
n3:dodaniDat
n12:2008
n3:domaciTvurceVysledku
n16:1798197
n3:druhVysledku
n7:J
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
510859
n3:idVysledku
RIV/00216305:26110/05:PU58257
n3:jazykVysledku
n17:eng
n3:klicovaSlova
Genetic algorithm, cluster analysis, shape, fragments, shape boundary, string code, optimization, fitness function, cartograms
n3:klicoveSlovo
n4:Genetic%20algorithm n4:cluster%20analysis n4:fitness%20function n4:cartograms n4:optimization n4:fragments n4:shape%20boundary n4:shape n4:string%20code
n3:kodStatuVydavatele
PL - Polská republika
n3:kontrolniKodProRIV
[5A3DB1B99D1A]
n3:nazevZdroje
ACTA SCUENTIARUM POLONORUM
n3:obor
n15:DE
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n14:GA102%2F04%2F0469
n3:rokUplatneniVysledku
n12:2005
n3:svazekPeriodika
2005
n3:tvurceVysledku
Bartoněk, Dalibor
s:issn
1644-0668
s:numberOfPages
9
n13:organizacniJednotka
26110