Five new species of the family Pterolichidae are described from two common non-parasitic cuckoo species of the subfamily Crotophaginae (Cuculiformes: Cuculidae) in Brazil: Aniacarus ani sp. n. from the Smooth-billed Ani, Crotophaga ani Linnaeus, A. simplex sp. n., A. robustus sp. n., A. coronatus sp. n. and Aniibius guirae sp. n. from the Guira Cuckoo, Guira guira (Gmelin). A key to all known s...

RNA secondary structure prediction uses techniques like crystallography, NMR spectroscopy etc. Computation based techniques estimate the possible base pairs that could be formed in RNA. Soft computing techniques generally select some random pair or pair sequences and then check them according to some parameters. The final sequence of RNA which is closest to the required fitness is selected as t...

In this article using Cuckoo Optimization Algorithm and simple additive weighting method the hybrid COAW algorithm is presented to solve multi-objective problems. Cuckoo algorithm is an efficient and structured method for solving nonlinear continuous problems. The created Pareto frontiers of the COAW proposed algorithm are exact and have good dispersion. This method has a high speed in finding ...

The standard cuckoo search algorithm is of low accuracy and easy to fall into local optimal value in the later evolution. In this paper, an improved cuckoo algorithm is proposed. Dynamic change of parameter of probability is introduced to improve the convergence speed. Complex method is quoted to improve the capabilities of local search algorithm. A non-fixed multi-segment mapping penalty funct...

The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm...

Cuckoo search (CS) is one of the most recent population-based meta-heuristics. CS algorithm is based on the cuckoo’s behaviour and the mechanism of Lévy flights. Unfortunately, the standard CS algorithm is proposed only for continuous optimisation problems. In this paper, we propose a discrete binary cuckoo search (BCS) algorithm in order to deal with binary optimisation problems. To get binary...

We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...

In this paper, Optimization is considered as the main impact of insight problem and heuristic methods. A proposed method is represented by using two optimization algorithms; cuckoo optimization; is heuristic method and Genetic algorithm; is meta-heuristic method in order to increase the optimization level and speed of calculation as possible. The proposed methodology and technique still a subje...

To expand the information of nest individuals, the idea of complex-valued encoding is used in cuckoo search (PCS); the gene of individuals is denoted by plurality, so a diploid swarm is structured by a sequence plurality. The value of independent variables for objective function is determined by modules, and a sign of them is determined by angles. The position of nest is divided into two parts,...