dc.creator | Čisar, Petar | |
dc.creator | Maravić-Cisar, Sanja | |
dc.creator | Subošić, Dane | |
dc.creator | Đikanović, Predrag | |
dc.creator | Đukanović, Slaviša | |
dc.date.accessioned | 2019-03-21T16:06:34Z | |
dc.date.available | 2019-03-21T16:06:34Z | |
dc.date.issued | 2015 | |
dc.identifier.issn | 1785-8860 | |
dc.identifier.uri | http://jakov.kpu.edu.rs/handle/123456789/660 | |
dc.description.abstract | The paper gives an analysis of some optimization algorithms in computer sciences and their implementation in solving the problem of binary character recognition. The performance of these algorithms is analyzed using the Optimization Algorithm Toolkit, with emphasis on determining the impact of parameter values. It is shown that these types of algorithms have shown a significant sensitivity as far as the choosing of the parameters was concerned which would have an effect on how the algorithm functions. In this sense, the existence of optimal value was found, as well as extremely unacceptable values. | en |
dc.publisher | Budapest Tech, Budapest | |
dc.rights | restrictedAccess | |
dc.source | Acta polytechnica hungarica | |
dc.subject | binary character recognition | en |
dc.subject | Optimization Algorithm Toolkit | en |
dc.subject | hill climbing | en |
dc.subject | random search | en |
dc.subject | clonal selection algorithm | en |
dc.subject | parameter tuning | en |
dc.title | Optimization Algorithms in Function of Binary Character Recognition | en |
dc.type | article | |
dc.rights.license | ARR | |
dcterms.abstract | Субошић, Дане; Маравић-Цисар, Сања; Ђукановић, Славиша; Чисар, Петар; Ђикановић, Предраг; | |
dc.citation.volume | 12 | |
dc.citation.issue | 7 | |
dc.citation.spage | 77 | |
dc.citation.epage | 87 | |
dc.citation.other | 12(7): 77-87 | |
dc.citation.rank | M23 | |
dc.identifier.rcub | https://hdl.handle.net/21.15107/rcub_jakov_660 | |
dc.identifier.scopus | 2-s2.0-84948740756 | |
dc.identifier.wos | 000366994500005 | |
dc.type.version | publishedVersion | |