default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahmoud El Chamie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j7]Mahmoud El Chamie, Dylan Janak, Behçet Açikmese:
Markov decision processes with sequential sensor measurements. Autom. 103: 450-460 (2019)- [j6]Mahmoud El Chamie
, Yue Yu, Behçet Açikmese, Masahiro Ono:
Controlled Markov Processes With Safety State Constraints. IEEE Trans. Autom. Control. 64(3): 1003-1018 (2019) - [c19]Mahmoud El Chamie, Lingyu Ren, Devu Manikantan Shila:
Optimal Strategic Pricing Attacks in Smart Grids: A Dynamic Programming Approach. CDC 2019: 4216-4221 - 2018
- [j5]Mahmoud El Chamie, Behçet Açikmese:
Safe Metropolis-Hastings algorithm and its application to swarm control. Syst. Control. Lett. 111: 40-48 (2018) - [j4]Nazli Demirer, Mahmoud El Chamie, Behçet Açikmese:
Safe Markov Chains for ON/OFF Density Control With Observed Transitions. IEEE Trans. Autom. Control. 63(5): 1442-1449 (2018) - [c18]Mahmoud El Chamie, Fu Lin:
Successive Linearization in Model-based Control for Thermal Management Systems. ACC 2018: 1540-1545 - [c17]Mahmoud El Chamie, Hala Mostafa:
Robust Action Selection in Partially Observable Markov Decision Processes with Model Uncertainty. CDC 2018: 5586-5591 - [c16]Mahmoud El Chamie, Kin Gwn Lore, Devu Manikantan Shila, Amit Surana:
Physics-Based Features for Anomaly Detection in Power Grids with Micro-PMUs. ICC 2018: 1-7 - 2017
- [c15]Mahmoud El Chamie, Behçet Açikmese:
Necessary and sufficient conditions for distributed averaging with state constraints. ACC 2017: 2008-2013 - [c14]Mahmoud El Chamie, Behçet Açikmese, Mehran Mesbahi:
Online learning for Markov decision processes applied to multi-agent systems. CDC 2017: 1596-1601 - 2016
- [j3]Sahar Hoteit, Mahmoud El Chamie, Damien Saucez, Stefano Secci:
On fair network cache allocation to content providers. Comput. Networks 103: 129-142 (2016) - [j2]Mahmoud El Chamie, Ji Liu, Tamer Basar:
Design and Analysis of Distributed Averaging With Quantized Communication. IEEE Trans. Autom. Control. 61(12): 3870-3884 (2016) - [c13]Mahmoud El Chamie, Behçet Açikmese:
Convex synthesis of optimal policies for Markov Decision Processes with sequentially-observed transitions. ACC 2016: 3862-3867 - [c12]Mahmoud El Chamie, Yue Yu, Behçet Açikmese:
Convex synthesis of randomized policies for controlled Markov chains with density safety upper bound constraints. ACC 2016: 6290-6295 - [c11]Mahmoud El Chamie, Behçet Açikmese:
Robust metropolis-hastings algorithm for safe reversible Markov chain synthesis. ACC 2016: 7117-7122 - [c10]Ji Liu, Mahmoud El Chamie, Tamer Basar, Behçet Açikmese:
The discrete-time Altafini model of opinion dynamics with communication delays and quantization. CDC 2016: 3572-3577 - [c9]Mahmoud El Chamie, Ji Liu, Tamer Basar, Behçet Açikmese:
Distributed averaging with quantized communication over dynamic graphs. CDC 2016: 4827-4832 - [c8]Ruohan Zhang, Yue Yu, Mahmoud El Chamie, Behçet Açikmese, Dana H. Ballard:
Decision-Making Policies for Heterogeneous Autonomous Multi-Agent Systems with Safety Constraints. IJCAI 2016: 546-553 - [i3]Masahiro Ono, Mahmoud El Chamie, Marco Pavone, Behçet Açikmese:
Mixed Strategy for Constrained Stochastic Optimal Control. CoRR abs/1607.01478 (2016) - 2015
- [j1]Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov:
Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization. IEEE Trans. Autom. Control. 60(5): 1350-1355 (2015) - [c7]Mahmoud El Chamie, Chadi Barakat, Giovanni Neglia:
Geographically fair in-network caching for mobile data offloading. Networking 2015: 1-9 - [i2]Mahmoud El Chamie, Behçet Açikmese:
Finite-Horizon Markov Decision Processes with Sequentially-Observed Transitions. CoRR abs/1507.01151 (2015) - [i1]Mahmoud El Chamie, Behçet Açikmese:
Finite-Horizon Markov Decision Processes with State Constraints. CoRR abs/1507.01585 (2015) - 2014
- [b1]Mahmoud El Chamie:
Optimization, control, and game theoretical problems in consensus protocols. (Optimisation, contrôle et the'orie des jeux dans les protocoles de consensus). University of Nice Sophia Antipolis, France, 2014 - [c6]Mahmoud El Chamie, Giovanni Neglia:
Newton's method for constrained norm minimization and its application to weighted graph problems. ACC 2014: 2983-2988 - [c5]Mahmoud El Chamie, Tamer Basar:
Optimal strategies for dynamic weight selection in consensus protocols in the presence of an adversary. CDC 2014: 735-740 - [c4]Mahmoud El Chamie, Ji Liu, Tamer Basar:
Design and analysis of distributed averaging with quantized communication. CDC 2014: 3860-3865 - [c3]Konstantin Avrachenkov, Mahmoud El Chamie, Giovanni Neglia:
Graph clustering based on mixing time of random walks. ICC 2014: 4089-4094 - 2013
- [c2]Mahmoud El Chamie, Giovanni Neglia, Konstantin Avrachenkov:
Reducing communication overhead for average consensus. Networking 2013: 1-9 - 2011
- [c1]Konstantin Avrachenkov, Mahmoud El Chamie, Giovanni Neglia:
A local average consensus algorithm for wireless sensor networks. DCOSS 2011: 1-6
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 2024-04-24 23:14 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:
