Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Saleh Khalaj Monfared"'
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2023, Iss 4 (2023)
The threat of chip-level tampering and its detection has been widely researched. Hardware Trojan insertions are prominent examples of such tamper events. Altering the placement and routing of a design or removing a part of a circuit for side-channel
Externí odkaz:
https://doaj.org/article/d97909d318154053b4143fddab3bd2ef
Autor:
Mohammadreza Daneshvaramoli, Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Helia karisani, Aku Visuri, Simo Hosio, Dara Rahmati, Saeid Gorgin
Publikováno v:
Lecture Notes in Networks and Systems ISBN: 9783030980146
In this work, first, we model the non-overlapping Multi-Agent Pathfinding (MAPF) to an NP-complete traditional puzzle called Numberlink puzzle owing to its features. Interestingly, this puzzle is reasonably shown to be analogous to the Flow Free game
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f24459ee86f485d61c0884003f2a47f5
http://urn.fi/urn:nbn:fi-fe2022060844853
http://urn.fi/urn:nbn:fi-fe2022060844853
Autor:
Mohammad Sina Karvandi, Saleh Khalaj Monfared, Mohammad Sina Kiarostami, Dara Rahmati, Saeid Gorgin
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031020667
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be1e26eb835f337dc83cb0b1a05c824a
https://doi.org/10.1007/978-3-031-02067-4_3
https://doi.org/10.1007/978-3-031-02067-4_3
Publikováno v:
Computer Networks. 223:109561
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81b62360864b8dd6a90232e9e1f9af88
https://doi.org/10.1016/j.comnet.2023.109561
https://doi.org/10.1016/j.comnet.2023.109561
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 30:2211-2222
In this work, a high-throughput bitsliced AES implementation is proposed, which builds upon a new data representation scheme that exploits the parallelization capability of modern multi/many-core platforms. This representation scheme is employed as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aeaf491a7d24442a2c94523d077ad3e
https://doi.org/10.1109/tpds.2019.2911278
https://doi.org/10.1109/tpds.2019.2911278
Autor:
Ehsan Futuhi, Mohammad Sina Kiarostami, Dara Rahmati, Saeid Gorgin, Saleh Khalaj Monfared, Hamed Khashehchi, Aku Visuri, Simo Hosio, Mohammadreza Daneshvaramoli, Helia Karisani
Solving puzzles has become increasingly important in artificial intelligence research since the solutions could be directly applied to real-world or general problems such as pathfinding, path planning, and exploration problems. Selecting the best app
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c76bcbc55e70e0367877f4c352eb9f8
http://urn.fi/urn:nbn:fi-fe2022022520848
http://urn.fi/urn:nbn:fi-fe2022022520848
Autor:
Soroush Meghdadi Zanjani, Saleh Khalaj Monfared, Dara Rahmati, Omid Hajihassani, Mohammad Sina Kiarostami, Saeid Gorgin
Publikováno v:
ICPP Workshops
In this work, a high throughput method for generating high-quality Pseudo-Random Numbers using the bitslicing technique is proposed. In such a technique, instead of the conventional row-major data representation, column-major data representation is e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ca7a6092ca43f93c6d35039e780222e
https://doi.org/10.1145/3409390.3409402
https://doi.org/10.1145/3409390.3409402
Autor:
Helia Karisani, Keivan Dehghannayeri, Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Saeid Gorgin, Mohammadreza Daneshvaramoli, Dara Rahmati
Publikováno v:
2020 6th International Conference on Control, Automation and Robotics (ICCAR).
Cooperative task assignment is an important subject in multi-agent systems with a wide range of applications. These systems are usually designed with massive communication among the agents to minimize the error in pursuit of the general goal of the e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1388a6ee4ea5025b96214f54532d827
https://doi.org/10.1109/iccar49639.2020.9108073
https://doi.org/10.1109/iccar49639.2020.9108073
Autor:
Dara Rahmati, Mohammad Sina Kiarostami, Saeid Gorgin, Saleh Khalaj Monfared, Mohammad Reza Daneshvaramoli
Publikováno v:
CoG
In this work, we propose a novel implementation of Monte-Carlo Tree Search (MCTS) algorithm to solve a multiagent pathfinding (MAPF) problem. We employ an optimization of MCTS with low time-complexity and acceptable reliability to approach the MAPF p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d31d0e60127e914e5a00a8ec98ed4bb4
https://doi.org/10.1109/cig.2019.8848043
https://doi.org/10.1109/cig.2019.8848043