Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Mudassir Shabbir"'
Publikováno v:
Neural Computing and Applications. 35:12145-12157
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58a037fc90800ae92b96250bc37f139e
https://doi.org/10.1007/s00521-023-08346-x
https://doi.org/10.1007/s00521-023-08346-x
Publikováno v:
IEEE Transactions on Robotics. 38:3550-3563
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c45935c2d3beb0c259a21d13dd179f07
https://doi.org/10.1109/tro.2022.3178296
https://doi.org/10.1109/tro.2022.3178296
Publikováno v:
Language Resources and Evaluation. 57:915-944
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fb420537dd0742999452d51adc82bb7
https://doi.org/10.1007/s10579-022-09610-7
https://doi.org/10.1007/s10579-022-09610-7
Publikováno v:
Neurocomputing. 433:108-118
Recent advancements in learning from graph-structured data have shown promising results on the graph classification task. However, due to their high time complexities, making them scalable on large graphs, with millions of nodes and edges, remains a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecf10cfafc51d47746e9fd502146c521
https://doi.org/10.1016/j.neucom.2020.12.075
https://doi.org/10.1016/j.neucom.2020.12.075
Publikováno v:
Discrete Applied Mathematics. 292:59-63
Seymour’s Second Neighborhood Conjecture states that every simple oriented graph has a vertex such that the cardinality of its second neighborhood is greater than or equal to the cardinality of its first neighborhood. The conjecture has been shown
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0a3cd5ff1bca64ffc39a01bdab3ea50
https://doi.org/10.1016/j.dam.2020.12.026
https://doi.org/10.1016/j.dam.2020.12.026
Publikováno v:
Journal of Ambient Intelligence and Humanized Computing. 13:313-327
Finding an optimal location for a future facility amidst existing sites is a challenging task—and potentially has numerous applications in resource planning. Formally, given a set of candidate sites S and existing sites E, the Optimal Site Selectio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d7588f29d3aaefbd6810d900aa5509b
https://doi.org/10.1007/s12652-021-02903-9
https://doi.org/10.1007/s12652-021-02903-9
Publikováno v:
2022 30th Mediterranean Conference on Control and Automation (MED).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab135e368135ed56ccbaaa7a420dfda2
https://doi.org/10.1109/med54222.2022.9837237
https://doi.org/10.1109/med54222.2022.9837237
Publikováno v:
2022 American Control Conference (ACC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3001de86beb3570ac6bbdb6306dbab89
https://doi.org/10.23919/acc53348.2022.9867655
https://doi.org/10.23919/acc53348.2022.9867655
Publikováno v:
IEEE Transactions on Control of Network Systems. 7:1891-1902
In this article, we demonstrate a conflicting relationship between two crucial properties— controllability and robustness —in linear dynamical networks of diffusively coupled agents. In particular, for any given number of nodes $N$ and diameter $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e519d7c96b6d576ae6a60b3b46e659b6
https://doi.org/10.1109/tcns.2020.3011814
https://doi.org/10.1109/tcns.2020.3011814
Publikováno v:
Information Sciences. 533:169-180
Graph representations that preserve relevant topological information allow the use of a rich machine learning toolset for data-driven network analytics. Some notable graph representations in the literature are fruitful in their respective application
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc2cd6bde34b39d3959bfea304db7f04
https://doi.org/10.1016/j.ins.2020.05.032
https://doi.org/10.1016/j.ins.2020.05.032