Time filter

Source Type

Belgrade, Serbia

The Megatrend University is a private university located in Belgrade, Serbia. Megatrend Business school, which later became Megatrend University, was founded in 1989. In an article about problems in Serbian higher education, Al Jazeera described Megatrend as "essentially a degree mill where diplomas can be obtained for cash." Wikipedia.

Alihodzic A.,University of Sarajevo | Tuba M.,Megatrend University
Scientific World Journal | Year: 2014

Multilevel image thresholding is a very important image processing technique that is used as a basis for image segmentation and further higher level processing. However, the required computational time for exhaustive search grows exponentially with the number of desired thresholds. Swarm intelligence metaheuristics are well known as successful and efficient optimization methods for intractable problems. In this paper, we adjusted one of the latest swarm intelligence algorithms, the bat algorithm, for the multilevel image thresholding problem.The results of testing on standard benchmark images show that the bat algorithm is comparable with other state-of-the-art algorithms. We improved standard bat algorithm, where our modifications add some elements from the differential evolution and from the artificial bee colony algorithm. Our new proposed improved bat algorithm proved to be better than five other state-of-the-art algorithms, improving quality of results in all cases and significantly improving convergence speed. Copyright © 2014 A. Alihodzic and M. Tuba. Source

Tuba M.,Megatrend University | Jovanovic R.,Texas A&M University at Qatar
International Journal of Computers, Communications and Control | Year: 2013

A new, improved ant colony optimization algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem. Algorithm modification is based on undesirability of some elements of the current best found solution. The pheromone values for highly undesirable links are significantly lowered by this a posteriori heuristic. This new hybridized algorithm with the strategy for avoiding stagnation by leaving local optima was tested on standard benchmark problems from the TSPLIB library and superiority of our method to the basic ant colony optimization and also to the particle swarm optimization is shown. The best found solutions are improved, as well as the mean values for multiple runs. The computation cost increase for our modification is negligible. © 2006-2013 by CCC Publications. Source

Jovanovic R.,Institute of Physics Belgrade | Tuba M.,Megatrend University
Applied Soft Computing Journal | Year: 2011

The minimum weight vertex cover problem is an interesting and applicable NP-hard problem that has been investigated from many different aspects. The ant colony optimization metaheuristic is a relatively new technique that was successfully adjusted and applied to many hard combinatorial optimization problems, including the minimum weight vertex cover problem. Some kind of hybridization or exploitation of the knowledge about specific problem often greatly improves the performance of standard evolutionary algorithms. In this article we propose a pheromone correction heuristic strategy that uses information about the best-found solution to exclude suspicious elements from it. Elements are suspicious if they have some undesirable properties that make them unlikely members of the optimal solution. This hybridization improves pure ant colony optimization algorithm by avoiding early trapping in local convergence. We tested our algorithm on numerous test-cases that were used in the previous research of the same problem and our algorithm uniformly performed better, giving slightly better results in significantly shorter time. © 2011 Elsevier B.V. All rights reserved. Source

Jovanovic R.,Texas A&M University at Qatar | Tuba M.,Megatrend University
Computer Science and Information Systems | Year: 2013

In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easily trapped in local optima. We have shown that by adding a pheromone correction strategy and dedicating special attention to the initial condition of the ACO algorithm this negative effect can be avoided. Using this approach it is possible to achieve good results without using the complex two-step ACO algorithm previously developed. We have tested our method on standard benchmark data and shown that it is competitive to the existing algorithms. Source

Devedzic V.,University of Belgrade | Milenkovic S.R.,Megatrend University
IEEE Transactions on Education | Year: 2011

This paper describes the authors' experience of teaching agile software development to students of computer science, software engineering, and other related disciplines, and comments on the implications of this and the lessons learned. It is based on the authors' eight years of experience in teaching agile software methodologies to various groups of students at different universities, in different cultural settings, and in a number of courses and seminars. It specifically discusses three different courses on agile software development, given in different teaching settings and at different levels, and briefly surveys variations to these courses given elsewhere. Based on the experience acquired, analyses and evaluations conducted, and current pedagogical trends at relevant university departments, the authors provide recommendations on how to overcome potential problems in teaching agile software development and make their adoption more effective. © 2011 IEEE. Source

Discover hidden collaborations