Format: HTML | BibTeX | DC | EndNote | NLM | MARC | MARCXML
Published Article / ENY-ARTICLE-2008-137

The genetic algorithm using to the analysis of thermally stimulated currents spectrum

Rezmer, J (Wroclaw University of Technology) ; Gubanski, A (Wroclaw University of Technology) ; Wrobel, J M (Department of Physics, University of Missouri - KC, Kansas City, MO 64110, USA)


Abstract: In order to separate individual relaxation processes and estimate the corresponding parameters, the genetic algorithm has been used [4]. The genetic algorithms belong to a wide class of optimization methods, which imitate processes taking place in nature. They are numerical procedures that utilize random choices in a highly directed search of the optimal solution. The algorithms are durable and effective in analyzing processes in very complicated solution spaces, such as the estimation of a complex TSD spectrum.

Keyword(s): EEEIC ; relaxation process ; parameter estimation ; genetic algorithm
Note: Proceedings of the 7th Int. Conference EEEIC 2008, Cottbus, 5-11.05.2008, pp. 47-48

Fulltext :

Cited by: try citation search for ENY-ARTICLE-2008-137

Rekord stworzony 2008-04-22, ostatnia modyfikacja 2008-05-31

Podobne rekordy

Osoby, które oglądały tę stronę, oglądały również:
(1024)  Proceedings of the Int. Conference "7th EEEIC International Workshop on Environment and Electrical Engineering" - Schwarz, H et al - ENY-PREPRINT-2008-008
(1000)  Adaptacyjne sieci neuronowe w zastosowaniu do identyfikacji stanu układów elektrycznych - Kostyla, P - ENY-THESIS-2008-005
(985)  Impact of Distributed Generation on Electrical Power Network - Khan, U N - ENY-ARTICLE-2008-142
(978)  Evaluation of compensation devices of DC arc furnaces using advanced spectrum estimation methods - Bracale, A et al - ENY-ARTICLE-2008-011
(958)  Parametric methods for time-frequency analysis of electric signals - Leonowicz, Z - ENY-BOOK-2008-001

Oceń ten dokument:
Bądź pierwszy i oceń ten dokument.

Dyskusja nad tym dokumentem:
Rozpocznij dyskusję o tym dokumencie.