Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
FCM is sensitive to initialization and tends to result in local minimum in iterations. This paper studies the crossover and mutation probability of genetic algorithm and presents a new crossover and mutation probability. The proposed clustering scheme based on genetic algorithm and fuzzy c-means takes full advantage of the global optimization of genetic algorithm and the local search ability of FCM...
We provide a nonasymptotic bound on the distance between a noncentral chi square distribution and a normal approximation. It improves on both the classical Berry-Esséen bound and previous distances derived specifically for this situation. First, the bound is nonasymptotic and provides an upper limit for the real distance. Second, the bound has the correct rate of decrease and even the correct leading...
This paper describes a Genetic Algorithm with Resolution Adaptation (GARA) used to solve System Identification (SI) problems. The algorithm is both hybrid, because it combines the genetic search with a fast local hill climbing method to improve the speed of convergence, and adaptive, because it uses information on the actual convergence of the population to modify the resolution of the binary representation...
In evolutionary computation, crowding is a popular technique to handle multi-modal optimization problems, which include many possible local or global optimal solutions. In our previous publication, we proposed a new evolutionary algorithm, called DEAL (Direction-guided Evolutionary Algorithm). It works effectively on non-linear optimization problems. In this paper, we extend further DEAL towards the...
The cutting stock problem (CSP) is an important problem in class of combinatorial optimization problems because of its NP-hard nature. Cutting of the required material from available stock with minimum wastage is a challenging process in many manufacturing industries such as rod industry, paper industry, textile industry, wood industry, plastic and leather manufacturing industry etc. The objective...
This paper provides a detailed description of a novel multivariant optimization algorithm (MOA) for multi-modal optimization with the main idea to share search information by organizing all search atoms into a special designed structure. Its multiple and variant group property make MOA capable on multi-modal optimization problems. The capability of the MOA method in locating and maintaining multi...
In order to improve the performance of LMS (Least Mean Square) adaptive filtering algorithm, an improved robustness adaptive step-size LMS equalization algorithm was presented by establishing a nonlinear relationship between the two relevant statistics for step-size factor μ(n) and the error signal e(n). Compared with other algorithms, this algorithm overcomes of sensitivity to the noise coming from...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.