This paper proposes a study of quality of service (QoS) in cognitive radio networks. This study is based on a stochastic optimization method called shuffled frog leaping algorithm (SFLA). The interest of the SFLA algorithm is to guarantee a better solution in a multi-carrier context in order to satisfy the requirements of the secondary user (SU).

rainfall-runoff modeling is most important component in the water resource management of river basins. the successful application of a conceptual rainfall-runoff model depends on how well it is calibrated. the degree of difficulty in solving the global optimization method is generally dependent on the dimensionality of the model and certain of the characteristics of object function. the purpose...

Optimal placement and sizing of DG in distribution network is an optimization problem with continuous and discrete variables. Many researchers have used evolutionary methods for finding the optimal DG placement. This paper proposes a shuffled frog leaping algorithm (SFLA) for optimal placement and sizing of distributed generation (DG) in radial distribution system to minimize the total real pow...

The frequency modulation sound parameter identification is a complex multimodal optimization problem. This problem is modeled in the form of a cost function that is the sum-squared error between the samples of estimated wave and the samples of real wave. In this research, the authors propose a shuffled particle swarm optimization algorithm to solve this problem. In the shuffled particle swam op...

This paper studies wireless sensor networks node deployment problem and proposes intelligent single particle optimizer based wireless sensor networks adaptive coverage. According to the probability model measure characteristic of wireless sensor nodes, the method adaptively determines the optimal deployment of sensor nodes using intelligent single particle optimizer, achieving sensor node based...

The paper proposes shuffled frog leaping algorithm (SFLA) based on enhanced learning, which generates a virtual general centre frog that is related to the optimal frog of each memeplex. The algorithm can utilise the superior information of each memeplex, enhance the mutual learning and use the average centre of optimal frog. In the processing of evolution, the optimal frog of sub-memeplex learn...