Chosen Optimization Methods for Search Data

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F11%3A86079874" target="_blank" >RIV/61989100:27230/11:86079874 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/CarpathianCC.2011.5945882" target="_blank" >http://dx.doi.org/10.1109/CarpathianCC.2011.5945882</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CarpathianCC.2011.5945882" target="_blank" >10.1109/CarpathianCC.2011.5945882</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Chosen Optimization Methods for Search Data

Popis výsledku v původním jazyce

This work deals with comparison and testing of chosen heuristic methods for searching minimum value. Chosen methods are local search method, hill climbing algorithm, tabu search method and simulated annealing method. For comparison algorithms of all selected heuristic method have been created application. Every method is possible to set to algorithm with different way, while method is keeping its principle. In most of cases, comparison method is possible to use on different number of values, for examplefor searching in one column in accurate range or in all columns in a same range. So in application was created nineteen different algorithms of chosen heuristic methods. Algorithms are used three types of databases: Continuous, Random and Similar Continuous. Effectivess of algorithms for searching minimum sum of values from all columns of database is tested on these data. Progresses of the way of every algorithm are shown on the graph.

Název v anglickém jazyce

Chosen Optimization Methods for Search Data

Popis výsledku anglicky

This work deals with comparison and testing of chosen heuristic methods for searching minimum value. Chosen methods are local search method, hill climbing algorithm, tabu search method and simulated annealing method. For comparison algorithms of all selected heuristic method have been created application. Every method is possible to set to algorithm with different way, while method is keeping its principle. In most of cases, comparison method is possible to use on different number of values, for examplefor searching in one column in accurate range or in all columns in a same range. So in application was created nineteen different algorithms of chosen heuristic methods. Algorithms are used three types of databases: Continuous, Random and Similar Continuous. Effectivess of algorithms for searching minimum sum of values from all columns of database is tested on these data. Progresses of the way of every algorithm are shown on the graph.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of 12th International Carpathian Control Conference ICCC´ 2011

ISBN

978-1-61284-359-9

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

330-334

Název nakladatele

Institute of Electrical and Electronics Engineers

Místo vydání

New York

Místo konání akce

Velké Karlovice

Datum konání akce

25. 5. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—