نتایج جستجو برای: benchmark functions
تعداد نتایج: 544592 فیلتر نتایج به سال:
In this paper, we propose the spectral collocation method based on radial basis functions to solve the fractional Bagley-Torvik equation under uncertainty, in the fuzzy Caputo's H-differentiability sense with order ($1< nu < 2$). We define the fuzzy Caputo's H-differentiability sense with order $nu$ ($1< nu < 2$), and employ the collocation RBF method for upper and lower approximate solutions. ...
We propose faster-computing methods for the minimization algorithm of AND-EXOR expressions, or Exclusive-or Sum-Of-Products expressions (ESOPs), and obtain the exact minimum ESOPs of benchmark functions. These methods improve the search procedure for ESOPs, which is the most time-consuming part of the original algorithm. For faster computation, the search space for ESOPs is reduced by checking ...
In a recent paper [1], it was shown that a new Genetic Algorithm (GA) performed better than basic GA. In the present paper, we will focus an Improved Genetic Algorithm which uses the theory of cosets. The new technique was tested using some benchmark functions [2] which the basic GA performance was not good enough. The main purpose of this paper is to suggest how to use Linear Codes properties ...
this study investigated the functions, types and frequencies of code switching in the teachers and students discourse in elt classrooms. to this end, the participants of this study including two groups of teachers and students were selected. the first group of participants were two efl teachers teaching general english courses (at two different levels of proficiency) in an institutional program...
The main objective of this thesis was to develop and analyse a PSO-based MOA for DMOO. However, in order to determine whether the algorithm efficiently solves DMOOPs, benchmark functions are required that are representative of typical real-world problems. Furthermore, performance measures are required to quantify the performance of the algorithm. Chapter 3 provided a comprehensive overview of b...
Optimization can be defined as finding the best solution for a problem. This process can be achieved by setting the initial parameters based on available information. Various optimization algorithms have been proposed for solving such problems. One cannot expect all optimization algorithms available to produce suitable and effective solutions for all optimization problems. Therefore, it is nece...
We have employed a recent implementation of genetic algorithms to study a range of standard benchmark functions for global optimization. It turns out that some of them are not very useful as challenging test functions, since they neither allow for a discrimination between different variants of genetic operators nor exhibit a dimensionality scaling resembling that of real-world problems, for exa...
The Artificial Bee Colony (ABC) algorithm is one of most popular stochastic, swarm based algorithm proposed by Karaboga in 2005 inspired from the foraging behaviour of honey bees. ABC has been applied to solve several problems in various fields and also many researchers have attempted to improve ABC’s performance by making some modifications. This paper proposes a new variant of ABC algorithm b...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید