![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
K. Sonam
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i2]G. Revati, Syed Shadab, K. Sonam, Sushama R. Wagh, Navdeep M. Singh:
Granger Causality for Predictability in Dynamic Mode Decomposition. CoRR abs/2210.12737 (2022) - 2021
- [j1]K. Sonam
, Sarang Sutavani
, S. R. Wagh
, Navdeep M. Singh
:
Optimal Control of Probabilistic Boolean Networks: An Information-Theoretic Approach. IEEE Access 9: 157068-157082 (2021) - [c11]K. Sonam, Sarang Sutavani, S. R. Wagh, F. S. Kazi, Navdeep M. Singh:
Optimal Control of Probabilistic Boolean Network using Embedding Framework. ACC 2021: 1028-1033 - [c10]N. Snehal, W. Pooja, K. Sonam, S. R. Wagh, Navdeep M. Singh:
Control of an Acrobot system using reinforcement learning with probabilistic policy search. ANZCC 2021: 68-73 - [c9]W. Pooja, N. Snehal, K. Sonam, S. R. Wagh, Navdeep M. Singh:
Effect of increased number of COVID-19 tests using supervised machine learning models. ANZCC 2021: 131-136 - 2020
- [c8]D. Vrushabh, Shalini K
, K. Sonam, S. R. Wagh, Navdeep M. Singh:
Adaptive Dynamic Programming for Optimal Synchronization of Kuramoto Oscillator. ACC 2020: 1755-1760 - [c7]D. Vrushabh, Shalini K
, K. Sonam:
Actor-Critic Algorithm for Optimal Synchronization of Kuramoto Oscillator. CoDIT 2020: 391-396 - [c6]Shalini K
, D. Vrushabh, K. Sonam:
On-policy Approximate Dynamic Programming for Optimal Control of non-linear systems. CoDIT 2020: 1058-1062 - [c5]M. Sawant, Joseph Moyalan, Sarang Sutavani, K. Sonam, Ramkrishna Pasumarthy, S. R. Wagh:
Design of Robust Gradient Method for Convex Optimization Problem using Biased Integral Quadratic Constraints. ECC 2020: 368-373 - [c4]A. Saija, K. Sonam, F. S. Kazi, Navdeep M. Singh:
Coherency Identification in Multimachine Power Systems Using Dynamic Mode Decomposition. ECC 2020: 1342-1347 - [c3]P. Akshay, D. Vrushabh, K. Sonam, S. R. Wagh, Navdeep M. Singh:
Hamiltonian Monte Carlo based Path Integral for Stochastic Optimal Control. MED 2020: 254-259 - [c2]D. Vrushabh, P. Akshay, K. Sonam, S. R. Wagh, Navdeep M. Singh:
Robust Path Integral Control on Stochastic Differential Games. MED 2020: 665-670
2010 – 2019
- 2019
- [c1]R. Sharma, A. Almelkar, K. Baghel, S. Syed, K. Sonam:
Extended High Gain Observer based Control Design for Buck-Boost Converters. CoDIT 2019: 669-674 - [i1]Sarang Sutavani, K. Sonam, S. R. Wagh, Navdeep M. Singh:
Disturbance Decoupling and Instantaneous Fault Detection in Boolean Control Networks. CoRR abs/1908.05235 (2019)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-08-22 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint