نتایج جستجو برای: bat algorithm
تعداد نتایج: 763517 فیلتر نتایج به سال:
Metaheuristic algorithms such as particle swarm optimization, firefly algorithm and harmony search are now becoming powerful methods for solving many tough optimization problems. In this paper, we propose a new metaheuristic method, the Bat Algorithm, based on the echolocation behaviour of bats. We also intend to combine the advantages of existing algorithms into the new bat algorithm. After a ...
This paper proposes the mean-dynamic VaR multi-period portfolio selection model with the transaction costs and the constraints on trade volumes. The Bat algorithm is applied to solve the multi-period mean-dynamic VaR model. Numerical results show that the Bat algorithm is effective and feasible to solve multi-period portfolio selection problems.
In this paper on which work done is nature inspired algorithm named Bat algorithm. nature is good source for inspiration in life in different way. Even in many search, nature gives good example for optimization many complex problems in engineering fields. Bat algorithm is metaheuristic algorithm like particle swarm, firefly. This paper formulates on echolocation behavior to reduce the crosstalk...
Nature inspired meta-heuristic algorithms are iterative search processes which find near optimal solutions by efficiently performing exploration and exploitation of the solution space. Considering the solution space in a specified region, this work compares performances of Bat, Cuckoo search and Firefly algorithms for unconstrained optimization problems. Global optima are found using various te...
Segmentation is one of the main tasks related to breast cancer classification. Automatic and semiautomatic algorithms have been proposed lately, and in this paper, a new method to segment mammography images is proposed using novel bat algorithm (NBA) and unsupervised metric measures as objective function. Results showed a useful method to segment mammographies using bioinspired algorithms based...
Computational aspects of Van der Sandt’s binding and accommodation theory (BAT) for presupposition projection and anaphora resolution are presented and discussed in this article. BAT is reformulated to meet requirements for computational implementation, which include operations on discourse representation structures (renaming and merging), the representation of presuppositions (allowing for sel...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید