default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Nazeem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c13]Ahmed Nazeem, Xinzhu Bei, Ruobing Chen, Shreyas Shrivastava:
Real-time Weapon Detection in Videos. ICPRAM 2022: 497-504- 2021
- [j10]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)
2010 – 2019
- 2019
- [j9]Aly Megahed, Jennifer A. Pazour, Ahmed Nazeem, Samir Tata, Mohamed Mohamed:
Monitoring services in the Internet of Things: an optimization approach. Computing 101(8): 1119-1145 (2019) - [j8]Aly Megahed, Ahmed Nazeem, Peifeng Yin, Samir Tata, Hamid Reza Motahari-Nezhad, Taiga Nakamura:
Optimizing cloud solutioning design. Future Gener. Comput. Syst. 91: 86-95 (2019) - 2018
- [c12]Shubhi Asthana, Aly Megahed, Ahmed Nazeem, Valeria Becker, Taiga Nakamura, Sandeep Gopisetty:
Solutioning of Highly-Valued IT Service Contracts. SCC 2018: 295-298 - 2017
- [c11]Aly Megahed, Samir Tata, Ahmed Nazeem:
Cognitive Determination of Policies for Data Management in IoT Systems. ICSOC Workshops 2017: 188-197 - [c10]Aly Megahed, Ahmed Nazeem, Peifeng Yin, Samir Tata, Hamid Reza Motahari-Nezhad, Taiga Nakamura:
An Optimization-Based Approach for Cloud Solution Design. OTM Conferences (1) 2017: 751-764 - 2015
- [j7]Ahmed Nazeem, Spyros A. Reveliotis:
Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks. Discret. Event Dyn. Syst. 25(1-2): 31-63 (2015) - 2014
- [j6]Ahmed Nazeem, Spyros A. Reveliotis:
Efficient Enumeration of Minimal Unsafe States in Complex Resource Allocation Systems. IEEE Trans Autom. Sci. Eng. 11(1): 111-124 (2014) - 2013
- [j5]Spyros A. Reveliotis, Ahmed Nazeem:
Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights. SIAM J. Control. Optim. 51(2): 1707-1726 (2013) - [j4]Roberto Cordone, Ahmed Nazeem, Luigi Piroddi, Spyros A. Reveliotis:
Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms. IEEE Trans. Autom. Control. 58(11): 2772-2787 (2013) - 2012
- [b1]Ahmed Nazeem:
Designing parsimonious representations of the maximally permissive deadlock avoidance policy for complex resource allocation systems through classification theory. Georgia Institute of Technology, Atlanta, GA, USA, 2012 - [j3]Ahmed Nazeem, Spiridon Reveliotis:
Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case. IEEE Trans. Autom. Control. 57(7): 1670-1684 (2012) - [c9]Ahmed Nazeem, Spyros A. Reveliotis:
An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems. CASE 2012: 686-693 - [c8]Roberto Cordone, Ahmed Nazeem, Luigi Piroddi, Spyros A. Reveliotis:
Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers. CDC 2012: 7244-7251 - [c7]Ahmed Nazeem, Spyros A. Reveliotis:
Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks. WODES 2012: 286-293 - 2011
- [j2]Ahmed Nazeem, Spyros A. Reveliotis, Yin Wang, Stéphane Lafortune:
Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case. IEEE Trans. Autom. Control. 56(8): 1818-1833 (2011) - [j1]Ahmed Nazeem, Spiridon Reveliotis:
A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems. IEEE Trans Autom. Sci. Eng. 8(4): 766-779 (2011) - [c6]Ahmed Nazeem, Spyros A. Reveliotis:
Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory. CASE 2011: 405-412 - [c5]Yin Wang, Ahmed Nazeem, Ram Swaminathan:
On the Optimal Petri Net Representation for Service Composition. ICWS 2011: 235-242 - 2010
- [c4]Ahmed Nazeem, Spiridon Reveliotis:
A practical approach to the design of maximally permissive liveness-enforcing supervisors for complex resource allocation systems. CASE 2010: 451-458 - [c3]Yin Wang, Hyoun Kyu Cho, Hongwei Liao, Ahmed Nazeem, Terence Kelly, Stéphane Lafortune, Scott A. Mahlke, Spyros A. Reveliotis:
Supervisory control of software execution for failure avoidance: Experience from the Gadara project. WODES 2010: 259-266 - [c2]Ahmed Nazeem, Spyros A. Reveliotis, Yin Wang, Stéphane Lafortune:
Optimal deadlock avoidance for complex resource allocation systems through classification theory. WODES 2010: 267-274
2000 – 2009
- 2009
- [c1]Yin Wang, Hongwei Liao, Ahmed Nazeem, Spyros A. Reveliotis, Terence Kelly, Scott A. Mahlke, Stéphane Lafortune:
Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract). CASE 2009: 37-41
Coauthor Index
aka: Spiridon Reveliotis
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 2024-04-24 22:58 CEST 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:
