Uroš Jovanovič

He received his B.Sc. and M.Sc. Degrees in the years 2003 and 2007, respectively, both at the University of Ljubljana, Faculty of Computer and Information Science.

Function: Research  & Development

His main research interest is in the field of the theory of computation, more precisely, in self-improving heuristics for solving combinatorial optimization problems. His other research interests are in machine and reinforcement learning, proof generation, artificial life and societies, kernel methods, game theory, biochemistry and micro biology.

His current research involves exploration of biologically inspired algorithms, such as ant colony optimization and cellular automata and its application to solve clustering of data in peer-to-peer networks (or any other distributed system) based on arbitrary logic relation between the data.

Some of his previous research was in the field of combinatorial optimization and graph theory applied in the field of tightly coupled distributed systems (such as clusters), where he developed a highly scalable and efficient cluster topology called d-mesh.

The second part was (and in some degree still is) in the field of data mining and clustering techniques applied, for example, on the problem for searching similarities between images.

One of his early works was a proof generator for solving and searching of rules in string and number sequences, such as 1,1,2,3,5,… written in logic language Prolog.