Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "estimation algorithm" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
A highly accurate DFT-based parameter estimator for complex exponentials
Autorzy:
Tsui, J.
Reisenfeld, S.
Powiązania:
https://bibliotekanauki.pl/articles/309144.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
frequency estimation
phase estimation
amplitude estimation
DFT-based parameter estimation
spectral estimation
digital signal processing algorithm
complex exponential parameter estimation
Opis:
A highly accurate DFT-based complex exponential parameter estimation algorithm is presented in this paper. It will be shown that for large number of samples and high signal to noise ratio (SNR), the phase estimation error variance performance is only 0.0475 dB above the Cramer-Rao lower bound (CRLB) for phase estimation with unknown frequency and phase. The amplitude estimation error variance performance was found to lay on the CRLB for amplitude estimation. Exact phase and amplitude estimation can be achieved in the noiseless case with this algorithm. The algorithm has low implementation computational complexity and is suitable for numerous real time digital signal processing applications.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 1; 76-82
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Novel Technique of Optimization for the COCOMO II Model Parameters using Teaching-Learning-Based Optimization Algorithm
Autorzy:
Khuat, T. T.
Le, M. H.
Powiązania:
https://bibliotekanauki.pl/articles/309064.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
COCOMO II
cost estimation
NASA software
optimization
teaching-learning-based optimization algorithm
Opis:
Software cost estimation is a critical activity in the development life cycle for controlling risks and planning project schedules. Accurate estimation of the cost before the start-up of a project is essential for both the developers and the customers. Therefore, many models were proposed to address this issue, in which COCOMO II has been being widely employed in actual software projects. Good estimation models, such as COCOMO II, can avoid insufficient resources being allocated to a project. However, parameters for estimation formula in this model have not been optimized yet, and so the estimated results are not close to the actual results. In this paper, a novel technique to optimize the coefficients for COCOMO II model by using teaching-learning-based optimization (TLBO) algorithm is proposed. The performance of the model after optimizing parameters was tested on NASA software project dataset. The obtained results indicated that the improvement of parameters provided a better estimation capabilities compared to the original COCOMO II model.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 1; 84-89
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of multiple criteria evolutionary algorithms to vector optimisation, decision support and reference point approaches
Autorzy:
Szczepański, M.
Wierzbicki, A.P.
Powiązania:
https://bibliotekanauki.pl/articles/307706.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
algorytm ewolucyjny
optymalizacja wektorowa
evolutionary algorithm
vector optimisation
nadir point estimation
reference point techniques
Opis:
Multiple criteria evolutionary algorithms, being essentially parallel in their character, are a natural instrument of finding a representation of entire Pareto set (set of solutions and outcomes non-dominated in criteria space) for vector optimisation problems. However, it is well known that Pareto sets for problems with more than two criteria might become complicated and their representation very time-consuming. Thus, the application of such algorithms is essentially limited to bi-criteria problems or to vector optimisation problems with more criteria but of simple structure. Even in such cases, there are problems related to various important aspects of vector optimisation, such as the uniformity of representation of Pareto set, stopping tests or the accuracy of representing Pareto set, that are not fully covered by the broad literature on evolutionary algorithms in vector optimisation. These problems and related computational tests and experience are discussed in the paper. In order to apply evolutionary algorithms for decision support, it would be helpful to use them in an interactive mode. However, evolutionary algorithms are in their essence global and of batch type. Nevertheless, it is possible to introduce interactive aspects to evolutionary algorithms by focusing them on a part of Pareto set. The results of experimental tests of such modifications of evolutionary algorithms for vector optimisation are presented in the paper. Another issue related to vector optimisation problems with more than two criteria is the computational difficulty of estimating nadir points of Pareto set. The paper describes the use of diverse variants of evolutionary algorithms to the estimation of nadir points, together with experimental evidence.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 16-33
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies