Mohammad Reza Daneshvaramoli

According to our database, Mohammad Reza Daneshvaramoli authored at least 6 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Competitive Algorithms for Online Knapsack with Succinct Predictions.

Mohammadreza Daneshvaramoli, Helia Karisani, Adam Lechowicz, Bo Sun, Cameron Musco, Mohammad Hajiesmaili

CoRR, 2024

2021

Unlucky Explorer: A Complete non-Overlapping Map Exploration.

Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Mohammad Reza Daneshvaramoli, Negar Yousefian, Mahsa Massoud, Aku Visuri, Simo Hosio, Dara Rahmati, Saeid Gorgin

Proceedings of the WSSE 2021: The 3rd World Symposium on Software Engineering, Xiamen, China, September 24, 2021

On Using Monte-Carlo Tree Search to Solve Puzzles.

Mohammad Sina Kiarostami, Mohammad Reza Daneshvaramoli, Saleh Khalaj Monfared, Aku Visuri, Helia Karisani, Simo Hosio, Hamed Khashehchi, Ehsan Futuhi, Dara Rahmati, Saeid Gorgin

Proceedings of the ICCTA 2021: 7th International Conference on Computer Technology Applications, Vienna, Austria, July 13, 2021

2020

Unlucky Explorer: A Complete non-Overlapping Map Exploration.

Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Mohammad Reza Daneshvaramoli, Ali Oliayi, Negar Yousefian, Dara Rahmati, Saeid Gorgin

CoRR, 2020

2019

Decentralized Cooperative Communication-less Multi-Agent Task Assignment with Monte-Carlo Tree Search.

Mohammad Reza Daneshvaramoli, Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Helia Karisani, Hamed Khashehchi, Dara Rahmati, Saeid Gorgin, Amir Rahmati

CoRR, 2019

Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search.

Mohammad Sina Kiarostami, Mohammad Reza Daneshvaramoli, Saleh Khalaj Monfared, Dara Rahmati, Saeid Gorgin

Proceedings of the IEEE Conference on Games, 2019