Optimization Algorithms in Function of Binary Character Recognition

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.