PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fardad, Makan"

Author of the publication

copydeleteadd this publication to your clipboard
Identification of sparse communication graphs in consensus networks.

, , and . Allerton Conference, page 85-89. IEEE, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Fardad, Makan
add a person with the name Fardad, Makan
 

Other publications of authors with the same name

A Necessary and Sufficient Frequency Domain Criterion for the Passivity of SISO Sampled-Data Systems., and . IEEE Trans. Automat. Contr., 54 (3): 611-614 (2009)Optimal Control of Vehicular Formations With Nearest Neighbor Interactions., , and . IEEE Trans. Automat. Contr., 57 (9): 2203-2218 (2012)Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers., , and . IEEE Trans. Automat. Contr., 58 (9): 2426-2431 (2013)Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers, , and . CoRR, (2011)Progressive DNN Compression: A Key to Achieve Ultra-High Weight Pruning and Quantization Rates using ADMM., , , , , , , , , and 4 other author(s). CoRR, (2019)On the dual decomposition of linear quadratic optimal control problems for vehicular formations., , and . CDC, page 6287-6292. IEEE, (2010)On the properties of optimal weak links in consensus networks., , , and . CDC, page 2124-2129. IEEE, (2014)On optimal link creation for facilitation of consensus in social networks., , and . ACC, page 3790-3795. IEEE, (2014)Graph sparsification with graph convolutional networks., , , , , and . Int. J. Data Sci. Anal., 13 (1): 33-46 (2022)An Extension of the Argument Principle and Nyquist Criterion to a Class of Systems With Unbounded Generators., and . IEEE Trans. Automat. Contr., 53 (1): 379-384 (2008)