Attributes | Values |
---|
rdf:type
| |
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ě. (cs)
- 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. (en)
|
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 (en)
- Genetický algoritmus pro skládání celku ze seg mentů (cs)
|
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 (en)
- Genetický algoritmus pro skládání celku ze seg mentů (cs)
|
skos:notation
| - RIV/00216305:26110/05:PU58257!RIV08-GA0-26110___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26110/05:PU58257
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Genetic algorithm, cluster analysis, shape, fragments, shape boundary, string code, optimization, fitness function, cartograms (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - ACTA SCUENTIARUM POLONORUM
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |