Mohammad Reza Daneshvaramoli

According to our database1, Mohammad Reza Daneshvaramoli authored at least 7 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
Competitive Algorithms for Online Knapsack with Succinct Predictions.
CoRR, 2024

2021
Unlucky Explorer: A Complete non-Overlapping Map Exploration.
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.
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.
CoRR, 2020

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

Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search.
Proceedings of the IEEE Conference on Games, 2019


  Loading...