Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

in this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. the order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. in addition, storage space is constrained and the problem ...

In the current paper a rigorous mathematical language for comparing evolutionary computation techniques via their representation is developed. A binary semi-genetic algorithm is introduced, and it is proved that in a certain sense any reasonable evolutionary search algorithm can be re-encoded by a binary semi-genetic algorithm (see corollaries 15 and 16). Moreover, an explicit bijection between...

This paper employs a Markov model to study the relative performance of binary and Gray coding in the univariate marginal distribution algorithm, genetic algorithm, and stochastic hillclimbing. The results indicate that while there is little difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in t...

Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...

Mathematical models of biogeography inspired the development of the biogeography-based optimization algorithm. In this article we propose a binary version of biogeography-based optimization (BBO) for the Knapsack Problem. Two new mutation operators are proposed to extend the biogeography-based optimization algorithm to binary optimization problems. We also demonstrate the performance of the res...

evolutionary algorithms are some of the most crucial random approaches tosolve the problems, but sometimes generate low quality solutions. on the otherhand, learning automata are adaptive decision-making devices, operating onunknown random environments, so it seems that if evolutionary and learningautomaton based algorithms are operated simultaneously, the quality of results willincrease sharpl...

determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. it is a computationally intensive task due to the large number of simulation runs required. therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum number of...

A genetic algorithm implemented in Matlab is presented. Matlab is used for the following reasons: it provides many built in auxiliary functions useful for function optimization; it is completely portable; and it is eecient for numerical computations. The genetic algorithm toolbox developed is tested on a series of non-linear, multi-modal, non-convex test problems and compared with results using...