Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Parham, Mahmoud"'
Autor:
Pacut, Maciej, Parham, Mahmoud, Rybicki, Joel, Schmid, Stefan, Suomela, Jukka, Tereshchenko, Aleksandr
Online algorithms make decisions based on past inputs. In general, the decision may depend on the entire history of inputs. If many computers run the same online algorithm with the same input stream but are started at different times, they do not nec
Externí odkaz:
http://arxiv.org/abs/2102.09413
Autor:
Amiri, Saeed Akhoondian, Dudycz, Szymon, Parham, Mahmoud, Schmid, Stefan, Wiederrecht, Sebastian
This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling problem has
Externí odkaz:
http://arxiv.org/abs/1805.06315
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.
Autor:
Bagherzade, Mohammad, Parham, Mahmoud, Zohali, Somayeh, Molaei, Sedighe, Vafaeimanesh, Jamshid
Publikováno v:
Caspian Journal of Internal Medicine
Background: COVID-19 pandemic is a global concern. Unfortunately, there is no exclusive treatment for critical patients to survive. In this study, we suggest using a novel three-dimensional treatment mainly based upon immune system modulation to fix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::636553dabb00d4d95b1b4d9e8b33989a
http://europepmc.org/articles/PMC7780874
http://europepmc.org/articles/PMC7780874
Autor:
Parham, Mahmoud
Rechenzentren stehen vor wachsenden Herausforderungen hinsichtlich Skalierbarkeit und Betrieb aufgrund der rasanten Zunahme bandbreitenintensiver Anwendungen wie Remote-Zusammenarbeit und Video-Streaming-Dienste. Skalierbare Netzwerke müssen auf unv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb3c479a8f4ea1991319aab0ab86d9fb
Autor:
Pacut, Maciej, Parham, Mahmoud, Rybicki, Joel, Schmid, Stefan, Suomela, Jukka, Tereshchenko, Aleksandr
Online algorithms make decisions based on past inputs, with the goal of being competitive against an algorithm that sees also future inputs. In this work, we introduce time-local online algorithms; these are online algorithms in which the output at a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7378bbe5dfb699ed04793f30628edf49
Publikováno v:
Journal of Lipids. 6/3/2018, p1-5. 5p.
Publikováno v:
University of Vienna-u:cris
Modern communication networks support fast path restoration mechanisms which allow to reroute traffic in case of (possibly multiple) link failures, in a completely decentralized manner and without requiring global route reconvergence. However, devisi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bab5dbd23fc7a43486c19bdeb2711ea0
Publikováno v:
Indian Journal of Endocrinology & Metabolism. May/Jun2015, Vol. 19 Issue 3, p364-368. 5p.
Autor:
Parham, Mahmoud1, Asgarani, Firouzeh1, Bagherzadeh, Mohammad2, Ebrahimi, Gholamreaza3, Vafaeimanesh, Jamshid2 j.vafaeemanesh@muq.ac.ir
Publikováno v:
Thyroid Research & Practice. Jan-Apr2015, Vol. 12 Issue 1, p3-7. 5p.