We present an algorithm for calculating the quartet distance between two evolutionary trees of bounded degree on a common set of n species. The previous best algorithm has running time O(d2n2) when considering trees, where no node is of more than degree d. The algorithm developed herein has running time O(d9n log n)) which makes it the first algorithm for computing the quartet distance between ...

Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...

Differential Evolution (DE) is a simple but powerful evolutionary optimization algorithm with many successful applications. In this paper we propose Differential Evolution for Multiobjective Optimization (DEMO) – a new approach to multiobjective optimization based on DE. DEMO combines the advantages of DE with the mechanisms of Paretobased ranking and crowding distance sorting, used by state-of...

In this paper, a new approach to auction based dispatch algorithm in a deregulated power system using differential evolution technique is presented. In a deregulated power system, the production cost is replaced by seller’s bidden cost function including not only the production cost, but also the market strategy, which may become concave, whereas the conventional economic dispatch (ED) algorith...

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given in 1990 by Grigoriev for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The alg...

Binary low-density parity-check (LDPC) codes have recently emerged as a promising alternative to turbo codes and have been shown to achieve excellent coding gains in AWGN channels. Non-binary LDPC codes have demonstrated improved performance over binary LDPC codes but their decoding is computationally intensive. Fourier transform decoding can reduce the decoding complexity but has a number of p...

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...

There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...

This paper investigates the dynamics of evolutionary algorithms (EAs) without tness based selection (constant tness). Such algorithms exhibit a behavior similar to the MISR eeect (mutation-induced speciation by recombination) which has been found in the analysis of (== D ;) evolution strategies. It will be shown that this behavior can be observed in a variety of EAs, not only in unrestricted se...

This paper elaborates upon an idea and a development introduced and presented by Bersini in [1]. Roughly, by observing the search space of a combinatorial problem in a “clever” way, it can be drastically reduced. In order to discover this “clever way”, a second search process has to be engaged in the space of the observables. So two Genetic Algorithms (GAs) are intertwined to solve the whole pr...