( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parallel dynamic water supply scheduling in a cluster of computers.

, , , , и . Concurr. Comput. Pract. Exp., 13 (15): 1281-1302 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Moisés Osorio

Moisés Fernández Pérez

Alfonso Moisés Anzalod Meneses

Victor Moisés Villarejos Monroy

Simone Moises

 

Другие публикации лиц с тем же именем

Preprocessing time series with ICA and savitzky-golay filtering., , и . Neural Networks and Computational Intelligence, стр. 48-53. IASTED/ACTA Press, (2004)Theoretical Method for Solving BSS-ICA Using SVM., , , и . ICA, том 3195 из Lecture Notes in Computer Science, стр. 256-262. Springer, (2004)Web newspaper layout optimization using simulated annealing., , , , и . IEEE Trans. Syst. Man Cybern. Part B, 32 (5): 686-691 (2002)A Survey of Forecasting Preprocessing Techniques using RNs., , , и . Informatica (Slovenia), 29 (1): 13-32 (2005)Orthogonal transformations for optimal time series prediction., , , , и . ESANN, стр. 453-458. (2002)A New Radial Basis Function Networks Structure: Application to Time Series Prediction., , , , , , и . IJCNN (4), стр. 449-454. IEEE Computer Society, (2000)0-7695-0619-4.Expert Mutation Operators for the Evolution of Radial Basis Function Neural Networks., , , и . IWANN (1), том 2084 из Lecture Notes in Computer Science, стр. 538-545. Springer, (2001)Online Algorithm for Time Series Prediction Based on Support Vector Machine Philosophy., , и . International Conference on Computational Science, том 3037 из Lecture Notes in Computer Science, стр. 50-57. Springer, (2004)On-Line Optimization of Radial Basis Function Networks with Orthogonal Techniques., , и . IWANN (1), том 1606 из Lecture Notes in Computer Science, стр. 467-477. Springer, (1999)Parallel dynamic water supply scheduling in a cluster of computers., , , , и . Concurr. Comput. Pract. Exp., 13 (15): 1281-1302 (2001)