Array
(
[page] => 31
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 6026
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 22903
[vysledek_rok] => 2001
[nazev] => Modelování neurčitostí v problémech rozvrhování výroby
[nazev_orig] => Modelování neurčitostí v problémech rozvrhování výroby
[duvernost_udaju_id] => S
[popis] => Tato práce se zabývá problémem rozvrhování zakázkové výroby v podmínkách neurčitosti. Rozvrhování je obtížný kombinatorický problém a tudíž praktické problémy jsou obvykle řešeny pomocí heuristických metod. K často používaným heuristickým metodám patří simulované žíhání, zakázané hledání a genetické algoritmy. Při aplikaci heuristických metod je důležitá volba reprezentace problému. V tomto příspěvku je popsána reprezentace založená na disjunktivním grafu. Dále pak zkoumáme problém fuzzy rozvrhování, kde termíny zakázek a doby jejich zpracování jsou modelovány lichoběžníkovými fuzzy čísly.
[popis_orig] => Tato práce se zabývá problémem rozvrhování zakázkové výroby v podmínkách neurčitosti. Rozvrhování je obtížný kombinatorický problém a tudíž praktické problémy jsou obvykle řešeny pomocí heuristických metod. K často používaným heuristickým metodám patří simulované žíhání, zakázané hledání a genetické algoritmy. Při aplikaci heuristických metod je důležitá volba reprezentace problému. V tomto příspěvku je popsána reprezentace založená na disjunktivním grafu. Dále pak zkoumáme problém fuzzy rozvrhování, kde termíny zakázek a doby jejich zpracování jsou modelovány lichoběžníkovými fuzzy čísly.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => MAJER, P.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-85988-61-5
[identifikator_popis] => ISBN - Proceedings of the XIIIrd International Autumn Colloquium Advanced Simulation of Systems
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => MAJER, P. Modelování neurčitostí v problémech rozvrhování výroby. In Proceedings of the XIIIrd International Autumn Colloquium Advanced Simulation of Systems. Ostrava: Jan Štefan, MARQ, 2001. 6 s. ISBN: 80-85988-61-5.
[citace_html] => MAJER, P. Modelování neurčitostí v problémech rozvrhování výroby. In Proceedings of the XIIIrd International Autumn Colloquium Advanced Simulation of Systems. Ostrava: Jan Štefan, MARQ, 2001. 6 s. ISBN: 80-85988-61-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6026,
author="Petr {Majer}",
title="Modelování neurčitostí v problémech rozvrhování výroby",
booktitle="Proceedings of the XIIIrd International Autumn Colloquium Advanced Simulation of Systems",
year="2001",
pages="6",
publisher="Jan Štefan, MARQ",
address="Ostrava",
isbn="80-85988-61-5"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Modelling Uncertainty in Production Scheduling Problems
[popis_en] => This work deals with a problem of job shop scheduling under uncertainty. Scheduling is a hard combinatorial problem and therefore real-world problems are usually solved by heuristic methods. Frequently used heuristic methods are simulated annealing, tabu search and genetic algorithms. When applying heuristic methods, the choice of problem representation is important. In this paper the disjunctive graph-based representation is described. Next we studied with a fuzzy scheduling problem where due dates of jobs and processing times of job operations are modeled by trapezoidal fuzzy numbers.
[klicova_slova_en] => disjunctive graph, job shop scheduling, fuzzy sets
[vysledek_datum] => 2001-09-04T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 6256
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 23014
[vysledek_rok] => 2001
[nazev] => Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller
[nazev_orig] => Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller
[duvernost_udaju_id] => S
[popis] => Paper describes numerical experiments when Q-learning with implemented table grid is applied to the active magnetic bearing controller. The aim is to find the smallest grid of table of Q-learning architecture, which provide sufficient control of magnetic bearing. There are used linear and also nonlinear grids of the table. A simple single-mass model of the magnetic bearing is used. Q-learning using found values of the table was proved especially from a speed point of view. Presumably further experiment will lead to table improving learning process.
[popis_orig] => Paper describes numerical experiments when Q-learning with implemented table grid is applied to the active magnetic bearing controller. The aim is to find the smallest grid of table of Q-learning architecture, which provide sufficient control of magnetic bearing. There are used linear and also nonlinear grids of the table. A simple single-mass model of the magnetic bearing is used. Q-learning using found values of the table was proved especially from a speed point of view. Presumably further experiment will lead to table improving learning process.
[klicova_slova] => Q-learning, magnetic bearing controller, magnetic bearing
[klicova_slova_orig] => Q-learning, magnetic bearing controller, magnetic bearing
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => BŘEZINA, T.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-214-1894-X
[identifikator_popis] => ISBN - Mendel 2001
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => BŘEZINA, T. Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller. In Mendel 2001. Brno, ČR: 2001. 6 p. ISBN: 80-214-1894-X.
[citace_html] => BŘEZINA, T. Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller. In Mendel 2001. Brno, ČR: 2001. 6 p. ISBN: 80-214-1894-X.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6256,
author="Tomáš {Březina}",
title="Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller",
booktitle="Mendel 2001",
year="2001",
pages="6",
address="Brno, ČR",
isbn="80-214-1894-X"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller
[popis_en] => Paper describes numerical experiments when Q-learning with implemented table grid is applied to the active magnetic bearing controller. The aim is to find the smallest grid of table of Q-learning architecture, which provide sufficient control of magnetic bearing. There are used linear and also nonlinear grids of the table. A simple single-mass model of the magnetic bearing is used. Q-learning using found values of the table was proved especially from a speed point of view. Presumably further experiment will lead to table improving learning process.
[klicova_slova_en] => Q-learning, magnetic bearing controller, magnetic bearing
[vysledek_datum] => 2001-06-06T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 6339
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 23727
[vysledek_rok] => 2001
[nazev] => Nestandardní filtrace analogových signálů v programovatelných automatech
[nazev_orig] => Nestandardní filtrace analogových signálů v programovatelných automatech
[duvernost_udaju_id] => S
[popis] => Článek se zabývá nelineární filtrací analogových vstupů v programovatelných automatech Simatic S7-22x. Je popsán vliv volitelných parametrů na vlastnosti filtrace a jsou uvedeny příklady použití.
[popis_orig] => Článek se zabývá nelineární filtrací analogových vstupů v programovatelných automatech Simatic S7-22x. Je popsán vliv volitelných parametrů na vlastnosti filtrace a jsou uvedeny příklady použití.
[klicova_slova] => Filtrace, parametry filtrace, programovatelný automat, analogové vstupy
[klicova_slova_orig] => Filtrace, parametry filtrace, programovatelný automat, analogové vstupy
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => NĚMEC, Z.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-7318-005-7
[identifikator_popis] => ISBN - TD2001 - DIAGON 2001
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => NĚMEC, Z. Nestandardní filtrace analogových signálů v programovatelných automatech. In TD2001 - DIAGON 2001. Zlín: UTB ve Zlíně, Academia centrum, 2001. 4 s. ISBN: 80-7318-005-7.
[citace_html] => NĚMEC, Z. Nestandardní filtrace analogových signálů v programovatelných automatech. In TD2001 - DIAGON 2001. Zlín: UTB ve Zlíně, Academia centrum, 2001. 4 s. ISBN: 80-7318-005-7.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6339,
author="Zdeněk {Němec}",
title="Nestandardní filtrace analogových signálů v programovatelných automatech",
booktitle="TD2001 - DIAGON 2001",
year="2001",
pages="4",
publisher="UTB ve Zlíně, Academia centrum",
address="Zlín",
isbn="80-7318-005-7"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Nonstandard filtration analog signal in programmable logic controller.
[popis_en] => Article describe unwonted nonlinear filtration of analog signal in programmable logic controller.
[klicova_slova_en] => Filtration, filtration parametrs, programmable logic controller, analog inputs
[vysledek_datum] => 2001-04-04T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 6507
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 23126
[vysledek_rok] => 2001
[nazev] => Voronoiovy diagramy a Delaunayho triangulace
[nazev_orig] => Voronoiovy diagramy a Delaunayho triangulace
[duvernost_udaju_id] => S
[popis] => Voronoiovy diagramy a Delaunayho triangulace patří mezi základní struktury počítačové geometrie. Příspěvek se zabývá jejich vlastnostmi, konstrukcí a stručně shrnuje jejich využití v inženýrských aplikacích.
[popis_orig] => Voronoiovy diagramy a Delaunayho triangulace patří mezi základní struktury počítačové geometrie. Příspěvek se zabývá jejich vlastnostmi, konstrukcí a stručně shrnuje jejich využití v inženýrských aplikacích.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-248-0013-6
[identifikator_popis] => ISBN - Sborník z 10. semináře Moderní matematické metody v inženýrství 3mi
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Voronoiovy diagramy a Delaunayho triangulace. In Sborník z 10. semináře Moderní matematické metody v inženýrství 3mi. Ostrava: VŠB-TU Ostrava, 2001. 5 s. ISBN: 80-248-0013-6.
[citace_html] => ŠEDA, M. Voronoiovy diagramy a Delaunayho triangulace. In Sborník z 10. semináře Moderní matematické metody v inženýrství 3mi. Ostrava: VŠB-TU Ostrava, 2001. 5 s. ISBN: 80-248-0013-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6507,
author="Miloš {Šeda}",
title="Voronoiovy diagramy a Delaunayho triangulace",
booktitle="Sborník z 10. semináře Moderní matematické metody v inženýrství 3mi",
year="2001",
pages="5",
publisher="VŠB-TU Ostrava",
address="Ostrava",
isbn="80-248-0013-6"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Voronoi Diagrams and Delaunay Triangulation
[popis_en] => Voronoi diagrams and Delaunay triangulation belong to fundamental structures of the computational geometry. The contribution deals with their properties and cnstructiion and briefly summarises their engineering applications.
[klicova_slova_en] => computational geometry, Voronoi diagram, Delaunay triangulation
[vysledek_datum] => 2001-12-20T00:00:00+01:00
)
[4] => Array
(
[vysledek_id] => 6528
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 23156
[vysledek_rok] => 2001
[nazev] => On Finding Minimal Networks
[nazev_orig] => On Finding Minimal Networks
[duvernost_udaju_id] => S
[popis] => In many utilities, including electrical and telecommunication systems, VLSI design, distributed networks of materials, the goal is to find connections of minimum cost. These connections have a form of trees and may be limited to a given set of points (minimum spanning trees) or admit the use of additional points (Steiner trees). This paper gives a brief survey of typical approximate and heuristic approaches to Steiner tree problems.
[popis_orig] => In many utilities, including electrical and telecommunication systems, VLSI design, distributed networks of materials, the goal is to find connections of minimum cost. These connections have a form of trees and may be limited to a given set of points (minimum spanning trees) or admit the use of additional points (Steiner trees). This paper gives a brief survey of typical approximate and heuristic approaches to Steiner tree problems.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. On Finding Minimal Networks. In Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems. Brno: CSAEM/JCE Brno, 2001. 4 p.
[citace_html] => ŠEDA, M. On Finding Minimal Networks. In Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems. Brno: CSAEM/JCE Brno, 2001. 4 p.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6528,
author="Miloš {Šeda}",
title="On Finding Minimal Networks",
booktitle="Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems",
year="2001",
pages="4",
publisher="CSAEM/JCE Brno",
address="Brno"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => On Finding Minimal Networks
[popis_en] => In many utilities, including electrical and telecommunication systems, VLSI design, distributed networks of materials, the goal is to find connections of minimum cost. These connections have a form of trees and may be limited to a given set of points (minimum spanning trees) or admit the use of additional points (Steiner trees). This paper gives a brief survey of typical approximate and heuristic approaches to Steiner tree problems.
[klicova_slova_en] => minimum spanning tree, Steiner tree, approximation, heuristic
[vysledek_datum] => 2001-10-20T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 6531
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 23161
[vysledek_rok] => 2001
[nazev] => Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
[nazev_orig] => Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
[duvernost_udaju_id] => S
[popis] =>
[popis_orig] =>
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => ab
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs. In Abstracts of the European Operational Research Conference EURO 2001. Rotterdam: Netherlands Society for Operations Research, 2001. 1 s.
[citace_html] => ŠEDA, M. Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs. In Abstracts of the European Operational Research Conference EURO 2001. Rotterdam: Netherlands Society for Operations Research, 2001. 1 s.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6531,
author="Miloš {Šeda}",
title="Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs",
booktitle="Abstracts of the European Operational Research Conference EURO 2001",
year="2001",
pages="1",
publisher="Netherlands Society for Operations Research",
address="Rotterdam"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
[popis_en] => The Steiner tree problem in graphs (SPG) is concerned with connecting a subset of vertices at minimal cost. More precisely, given an undirected connected graph G=(V,E) with vertex set V, edge set E, nonnegative weights associated with the edges, and a subset B of V (called customer vertices or terminals), the problem is to find a subgraph, T, which connects the vertices in B so that the sum of the weights of the edges in T is minimized. It is obvious that the solution is always a tree and it is called a minimal Steiner tree for B in G. Applications of the SPG are frequently found in the layout of connection structures in networks and circuit design. Their common feature is that of connecting together a set of terminals (communications sites or circuits components) by a network of minimal total length. The contribution presents an application of stochastic heuristic methods in a combination with approximate algorithms and compares their effectiveness using standard benchmarks from OR-library.
[klicova_slova_en] => Steiner tree problem, stochastic heuristic methods, approximation methods
[vysledek_datum] => 2001-07-01T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 6611
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 21349
[vysledek_rok] => 2001
[nazev] => A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges
[nazev_orig] => A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges
[duvernost_udaju_id] => S
[popis] => Critical Path Method (CPM) is well known tool in project scheduling where time duration of activities and their precedence relationships are defined and resource capacities are not limited. In practice it usually is not satisfied. In spite of this, the CPM is a base of more general methods as PERT, solving the Resource Constrained Project Scheduling Problem (RCPSP), and Job Shop Scheduling Problem (JSSP) when it is represented by the disjunctive graph. RCPSP and JSSP are NP-hard problems and therefore it is necessary to solve them by heuristic methods. Here, with respect to high number of iterations, the effectiveness of the CPM calculations plays a substantial role. This contribution proposes a new implementation of the CPM using a lexicographical ordering of edges in network graphs and shows that its time complexity is lower than the time complexity of classical approaches. This conclusion is verified using the representative class of benchmarks.
[popis_orig] => Critical Path Method (CPM) is well known tool in project scheduling where time duration of activities and their precedence relationships are defined and resource capacities are not limited. In practice it usually is not satisfied. In spite of this, the CPM is a base of more general methods as PERT, solving the Resource Constrained Project Scheduling Problem (RCPSP), and Job Shop Scheduling Problem (JSSP) when it is represented by the disjunctive graph. RCPSP and JSSP are NP-hard problems and therefore it is necessary to solve them by heuristic methods. Here, with respect to high number of iterations, the effectiveness of the CPM calculations plays a substantial role. This contribution proposes a new implementation of the CPM using a lexicographical ordering of edges in network graphs and shows that its time complexity is lower than the time complexity of classical approaches. This conclusion is verified using the representative class of benchmarks.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-85988-57-7
[identifikator_popis] => ISBN - Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS '01
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges. In Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS '01. Ostrava: MARQ Ostrava, 2001. 6 p. ISBN: 80-85988-57-7.
[citace_html] => ŠEDA, M. A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges. In Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS '01. Ostrava: MARQ Ostrava, 2001. 6 p. ISBN: 80-85988-57-7.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT6611,
author="Miloš {Šeda}",
title="A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges",
booktitle="Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS '01",
year="2001",
pages="6",
publisher="MARQ Ostrava",
address="Ostrava",
isbn="80-85988-57-7"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges
[popis_en] => Critical Path Method (CPM) is well known tool in project scheduling where time duration of activities and their precedence relationships are defined and resource capacities are not limited. In practice it usually is not satisfied. In spite of this, the CPM is a base of more general methods as PERT, solving the Resource Constrained Project Scheduling Problem (RCPSP), and Job Shop Scheduling Problem (JSSP) when it is represented by the disjunctive graph. RCPSP and JSSP are NP-hard problems and therefore it is necessary to solve them by heuristic methods. Here, with respect to high number of iterations, the effectiveness of the CPM calculations plays a substantial role. This contribution proposes a new implementation of the CPM using a lexicographical ordering of edges in network graphs and shows that its time complexity is lower than the time complexity of classical approaches. This conclusion is verified using the representative class of benchmarks.
[klicova_slova_en] => CPM, PERT, time complexity, lexicographical ordering
[vysledek_datum] => 2001-05-05T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 6612
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 21350
[vysledek_rok] => 2001
[nazev] => Voronoi Diagrams and their Applications
[nazev_orig] => Voronoi Diagrams and their Applications
[duvernost_udaju_id] => S
[popis] => The Voronoi diagram is a fundamental structure in computational geometry and arises naturally in various branches of science. This paper surveys basic properties of the Voronoi diagram, algorithms for its construction, and typical applications of the Voronoi diagram and its geometric dual, the Delaunay triangulation.
[popis_orig] => The Voronoi diagram is a fundamental structure in computational geometry and arises naturally in various branches of science. This paper surveys basic properties of the Voronoi diagram, algorithms for its construction, and typical applications of the Voronoi diagram and its geometric dual, the Delaunay triangulation.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-7078-890-9
[identifikator_popis] => ISBN - Proceedings of the XXVIth Seminar ASR 2001 Instruments & Control
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Voronoi Diagrams and their Applications. In Proceedings of the XXVIth Seminar ASR 2001 Instruments & Control. Ostrava: VŠB-TU Ostrava, 2001. 8 p. ISBN: 80-7078-890-9.
[citace_html] => ŠEDA, M. Voronoi Diagrams and their Applications. In Proceedings of the XXVIth Seminar ASR 2001 Instruments & Control. Ostrava: VŠB-TU Ostrava, 2001. 8 p. ISBN: 80-7078-890-9.
[citace_rtf] =>
[citace_bibtex] =>
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Voronoi Diagrams and their Applications
[popis_en] => The Voronoi diagram is a fundamental structure in computational geometry and arises naturally in various branches of science. This paper surveys basic properties of the Voronoi diagram, algorithms for its construction, and typical applications of the Voronoi diagram and its geometric dual, the Delaunay triangulation.
[klicova_slova_en] => computational geometry, Voronoi diagram, Delaunay triangulation
[vysledek_datum] => 2001-04-20T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 31
[count] => 8
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /en/veda/publikace/detail/
[base_page] => /en/veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => MAJER, P.
[title] => Modelování neurčitostí v problémech rozvrhování výroby
[typ] => PV
[year] => 2001
[id_vav] => 6026
)
[1] => Array
(
[quotations] => BŘEZINA, T.
[title] => Effect of Table Grid at Q-learning Process of Active Magnetic Bearing Controller
[typ] => PV
[year] => 2001
[id_vav] => 6256
)
[2] => Array
(
[quotations] => NĚMEC, Z.
[title] => Nestandardní filtrace analogových signálů v programovatelných automatech
[typ] => PV
[year] => 2001
[id_vav] => 6339
)
[3] => Array
(
[quotations] => ŠEDA, M.
[title] => Voronoiovy diagramy a Delaunayho triangulace
[typ] => PV
[year] => 2001
[id_vav] => 6507
)
[4] => Array
(
[quotations] => ŠEDA, M.
[title] => On Finding Minimal Networks
[typ] => PV
[year] => 2001
[id_vav] => 6528
)
[5] => Array
(
[quotations] => ŠEDA, M.
[title] => Stochastic Heuristic Methods for the Steiner Tree Problem in Graphs
[typ] => PV
[year] => 2001
[id_vav] => 6531
)
[6] => Array
(
[quotations] => ŠEDA, M.
[title] => A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges
[typ] => PV
[year] => 2001
[id_vav] => 6611
)
[7] => Array
(
[quotations] => ŠEDA, M.
[title] => Voronoi Diagrams and their Applications
[typ] => PV
[year] => 2001
[id_vav] => 6612
)
)
)