نتایج جستجو برای: cuckoo search algorithm
تعداد نتایج: 981176 فیلتر نتایج به سال:
Artificial Neural Networks (ANN) techniques, mostly Back-Propagation Neural Network (BPNN) algorithm has been used as a tool for recognizing a mapping function among a known set of input and output examples. These networks can be trained with gradient descent back propagation. The algorithm is not definite in finding the global minimum of the error function since gradient descent may get stuck ...
Software testing is a very important phase in the development of software. Testing includes the generation of test cases which, if done manually, is time consuming. To automate this process and generate optimal test cases, several meta-heuristic techniques have been developed. These approaches include genetic algorithm, cuckoo search, tabu search, intelligent water drop, etc. This paper present...
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
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...
Here, metaheuristic search techniques are applied for robotic path planning. Robot has to move from its starting point called source point to final point called as destination point with minimum number of moves and iteration. Here both cuckoo search and bat algorithms are applied for the proposed problem and simulation results are compared. The techniques are applied for different number of pop...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید