Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Sagharichian, A."'
Publikováno v:
In Heliyon November 2023 9(11)
Publikováno v:
Heliyon, Vol 9, Iss 11, Pp e21593- (2023)
Pasteurization is a vital process to destroy harmful enzymes. This process is very critical to obtain quality tomato paste. In this study, Computational Fluid Dynamics (CFD) has been used to design a shell and tube heat exchanger on an industrial sca
Externí odkaz:
https://doaj.org/article/1a334889dd814ec295c514f65d13a4b9
Autor:
Sagharichian, Masoud1 (AUTHOR) m.sagharichian@alzahra.ac.ir, Alipour Langouri, Morteza2 (AUTHOR)
Publikováno v:
Journal of Supercomputing. Dec2023, Vol. 79 Issue 18, p21116-21143. 28p.
Autor:
Sagharichian, Masoud1 sagharichian@iust.ac.ir, Naderi, Hassan1 naderi@iust.ac.ir
Publikováno v:
Journal of Supercomputing. Apr2017, Vol. 73 Issue 4, p1438-1466. 29p.
Autor:
Masoud Sagharichian, Hassan Naderi
Publikováno v:
The Journal of Supercomputing. 73:1438-1466
Poor locality as a natural property of graph data structures causes enormous amount of network traffic in large-scale distributed graph processing systems. Moreover, data transmission through the network is one of the most expensive operations in a d
Publikováno v:
World Wide Web. 20:399-416
The breadth of problems requiring graph analytics is growing rapidly. Diameter is one of the most important metrics of a graph. The diameter is important in both designing algorithms for graphs and understanding the nature and evolution of graphs. Be
Publikováno v:
Concurrency and Computation: Practice and Experience. 27:4954-4969
These days, large-scale graph processing becomes more and more important. Pregel, inspired by Bulk Synchronous Parallel, is one of the highly used systems to process large-scale graph problems. In Pregel, each vertex executes a function and waits for
Publikováno v:
Web of Science
JUCS-Journal of Universal Computer Science 22(3): 302-318
JUCS-Journal of Universal Computer Science 22(3): 302-318
The variety of applications requiring graph analysis is growing rapidly. Diameter is one of the most important metrics of a graph. The diameter is important in both designing algorithms for graphs and understanding the nature and evolution of graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6714c617157b32e30b4ca9282b1fc49
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.