( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
K-Means VQ algorithm using a low-cost parallel cluster computing.

, , , , и . Parallel and Distributed Computing and Networks, стр. 392-397. IASTED/ACTA Press, (2004)

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.

Paulo César Souza

Philippe De Souza

Paulo Augusto Souza Nogueira

Marcelo José Lopes Souza

Paulo Antônio Souza Júnior

 

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

How to test your concurrent software: an approach for the selection of testing techniques., , , и . SEPS@SPLASH, стр. 42-43. ACM, (2017)Optimizing van der Waals calculi using Cell-lists and MPI., , , и . IEEE Congress on Evolutionary Computation, стр. 1-7. IEEE, (2010)A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing., , , , и . ICDAR, стр. 839-843. IEEE Computer Society, (2003)Using Coverage and Reachability Testing to Improve Concurrent Program Testing Quality., , , , , и . SEKE, стр. 207-212. Knowledge Systems Institute Graduate School, (2011)Teaching Parallel Programming for Beginners in Computer Science., , , и . FIE, стр. 1-9. IEEE, (2020)Structural testing criteria for message-passing parallel programs., , , , и . Concurr. Comput. Pract. Exp., 20 (16): 1893-1916 (2008)AMIGO: a contribution to the convergence in the area of process scheduling (AMIGO: Uma contribuição para a convergência na área de escalonamento de processos).. University of São Paulo, Brazil, (2000)ndltd.org (oai:agregador.ibict.br.BDTD_USP:oai:teses.usp.br:tde-25032014-152613).Software Testing applied to the Development of IoT Systems: preliminary results., , , , и . SAST, стр. 113-122. ACM, (2023)Mutation operators for concurrent programs in MPI., , и . LATW, стр. 1-6. IEEE Computer Society, (2012)Structural Testing for Semaphore-Based Multithread Programs., , , и . ICCS (1), том 5101 из Lecture Notes in Computer Science, стр. 337-346. Springer, (2008)