Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Ibrahim 0001
Person information
- affiliation: Cairo University, Department of Computer Engineering, Cairo, Egypt
- affiliation (PhD 2020): Georgia Institute of Technology, Atlanta, GA, USA
Other persons with the same name
- Michael Ibrahim 0002
![[0000-0002-1447-0885]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1447-0885")
— Ain Shams University, Communications and Signal Processing Research Laboratory, Cairo, Egypt - Michael Ibrahim 0003 — Poznan University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j4]Michael Ibrahim, Spyros A. Reveliotis, Ahmed Nazeem:
Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation. IEEE Trans. Autom. Control. 66(9): 3906-3921 (2021)- [c8]Kingsley Nweye, Zoltán Nagy, Sharada Mohanty, Dipam Chakraborty, Siva Sankaranarayanan, Tianzhen Hong, Sourav Dey, Gregor Henze, Ján Drgona, Fangquan Lin, Wei Jiang, Hanwei Zhang, Zhongkai Yi, Jihai Zhang, Cheng Yang, Matthew Motoki, Sorapong Khongnawang, Michael Ibrahim, Abilmansur Zhumabekov, Daniel May, Zhihu Yang, Xiaozhuang Song, Han Zhang, Xiaoning Dong, Shun Zheng, Jiang Bian:
The CityLearn Challenge 2022: Overview, Results, and Lessons Learned. NeurIPS (Competition and Demos) 2021: 85-103 - 2020
- [b1]Michael Ibrahim:
Scheduling Techniques for Complex Resource Allocation Systems. Georgia Institute of Technology, Atlanta, GA, USA, 2020
2010 – 2019
- 2019
- [j3]Michael Ibrahim, Spyros A. Reveliotis:
Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling. Discret. Event Dyn. Syst. 29(3): 393-409 (2019) - [j2]Michael Ibrahim, Spyros A. Reveliotis:
Throughput Maximization of Capacitated Re-Entrant Lines Through Fluid Relaxation. IEEE Trans Autom. Sci. Eng. 16(2): 792-810 (2019) - [c7]Michael Ibrahim, Spyros A. Reveliotis:
Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling (Extended Abstract). ETFA 2019: 1457-1460 - 2018
- [c6]Michael Ibrahim, Spyros A. Reveliotis:
Throughput maximization of capacitated re-entrant lines through fluid relaxation. ACC 2018: 3961-3968 - [c5]Michael Ibrahim, Spyros A. Reveliotis:
Maximal Linear Deadlock Avoidance Policies for Complex Resource Allocation Systems. CDC 2018: 3968-3974 - 2016
- [j1]Michael Nawar Ibrahim, Amir F. Atiya:
Analytical solutions to the dynamic pricing problem for time-normalized revenue. Eur. J. Oper. Res. 254(2): 632-643 (2016) - 2015
- [c4]Michael Nawar Ibrahim:
Statistical Arabic Grammar Analyzer. CICLing (1) 2015: 187-200 - 2014
- [c3]Michael N. Nawar:
Improving Arabic Tokenization and POS Tagging Using Morphological Analyzer. AMLTA 2014: 46-53 - [c2]Michael N. Nawar, Moheb M. Ragheb:
Multi-heuristic Based Algorithm for Test Case Prioritization. ICCSA (5) 2014: 449-460 - [c1]Michael N. Nawar, Moheb M. Ragheb:
Fast and Robust Arabic Error Correction System. ANLP@EMNLP 2014: 143-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-12-05 22:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
