Mohammad Reza Ghodsi

Dr. Mohammad Reza Ghodsi

Islamic Azad University, Khorramabad Branch, Khorramābād, Lorestān, Iran
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 January 2019 in Journal of Artificial Intelligence Research
Verified
Journal Article
Open access
PDF file
AFAlireza Farhadi
Alireza Farhadi
Mohammad Reza GhodsiMohammad Reza Ghodsi
Mohammad Reza Ghodsi
MHMohammad Taghi Hajiaghayi
Mohammad Taghi Hajiaghayi
SLSébastien Lahaie
Sébastien Lahaie
DPDavid Pennock
David Pennock
HYHadi Yami
Hadi Yami
We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings. Our emphasis is on the case where the goods are indivisible and agents have unequal entitlements. This problem is a generalization of the work by Procaccia and Wang (2014) wherein the agents are assumed to be symmetric with respect to their entitlements. Although Procaccia and Wang show an almost fair (constant approximation) allocation exists in their setting, our main result is in sharp contrast to their observation. We show that, in some cases with n agents, no allocation can guarantee better than 1/n approximation of a fair allocation when the entitlements are not necessarily equal. Furthermore, we devise a simple algorithm that ensures a 1/n approximation guarantee. Our second result is for a restricted version of the problem where the valuation of every agent for each good is bounded by the total value he wishes to receive in a fair allocation. Although this assumption might seem without loss of generality, we show it enables us to find a 1/2 approximation fair allocation via a greedy algorithm. Finally, we run some experiments on real-world data and show that, in practice, a fair allocation is likely to exist. We also support our experiments by showing positive results for two stochastic variants of the problem, namely stochastic agents and stochastic items.

29 February 2008 in Computational Geometry
Verified
Journal Article
Closed access
AZAlireza Zarei
Alireza Zarei
Mohammad Reza GhodsiMohammad Reza Ghodsi
Mohammad Reza Ghodsi

31 August 2022 in International Transactions on Electrical Energy Systems
Verified
Journal Article
Open access
PDF file
Mohammad Reza GhodsiMohammad Reza Ghodsi
Mohammad Reza Ghodsi
ATAlireza Tavakoli
Alireza Tavakoli
ASAmin Samanfar
Amin Samanfar
In order to support the inertia of a microgrid, virtual synchronous generator control is a suitable control method. However, the use of the virtual synchronous generator control leads to unacceptable transient active power sharing, active power oscillations, and the inverter output power oscillation in the event of a disturbance. This study aims to propose a deep neural network controller which combines the features of a restricted Boltzmann machine and a multilayer neural network. To initialize a multilayer neural network in the unsupervised pretraining method, the restricted Boltzmann machine is applied as a very important part of the deep learning controller. The Lyapunov stability method is used to update the weight of the deep neural network controller. The proposed method performs power oscillation damping and frequency stabilization. The experimental and simulation results are presented to assess the usefulness of the suggested method in damping oscillations and frequency stabilization.
1

11 March 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
NANima AhmadiPourAnari
Nima AhmadiPourAnari
SEShayan Ehsani
Shayan Ehsani
Mohammad Reza GhodsiMohammad Reza Ghodsi
Mohammad Reza Ghodsi
NHNima Haghpanah
Nima Haghpanah
NINicole Immorlica
Nicole Immorlica
VMVahab Mirrokni
Vahab Mirrokni

18 January 2013 in Journal of Scheduling
Verified
Journal Article
Open access
PDF file
EDErik D. Demaine
Erik D. Demaine
Mohammad Reza GhodsiMohammad Reza Ghodsi
Mohammad Reza Ghodsi
MHMohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi
ASAmin S. Sayedi-Roshkhar
Amin S. Sayedi-Roshkhar
MZMorteza Zadimoghaddam
Morteza Zadimoghaddam
This paper considers scheduling tasks while minimizing the power consumption of one or more processors, each of which can go to sleep at a fixed cost \(\alpha \). There are two natural versions of this problem, both considered extensively in recent work: minimize the total power consumption (including computation time), or minimize the number of “gaps” in execution. For both versions in a multiprocessor system, we develop a polynomial-time algorithm based on sophisticated dynamic programming. In a generalization of the power-saving problem, where each task can execute in any of a specified set of time intervals, we develop a \((1+{2 \over 3} \alpha )\)-approximation, and show that dependence on \(\alpha \) is necessary. In contrast, the analogous multi-interval gap scheduling problem is set-cover hard (and thus not \(o(\lg n)\)-approximable), even in the special cases of just two intervals per job or just three unit intervals per job. We also prove several other hardness-of-approximation results. Finally, we give an \(O(\sqrt{n})\)-approximation for maximizing throughput given a hard upper bound on the number of gaps.

1 February 2006 in Journal of Signal Processing Systems
Verified
Journal Article
Closed access
PDF file
GJGhassem Jaberipur
Ghassem Jaberipur
BPBehrooz Parhami
Behrooz Parhami
Mohammad Reza GhodsiMohammad Reza Ghodsi
Mohammad Reza Ghodsi