Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Satya Gautam, Vadlamudi"'
Autor:
Aritra Hazra, Saurav Kumar Ghosh, Partha Chakrabarti, Satya Gautam Vadlamudi, Soumyajit Dey, P. Vishnuvardhan
Publikováno v:
Design Automation for Embedded Systems. 21:37-87
With the increase in the complexity of safety-critical embedded applications, the reliability analysis of such systems have also become increasingly difficult. For such complex system specifications, if the reliability provisions are declared upfront
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2f5aba717bed5fae28016cbf4c9cd7f
https://doi.org/10.1007/s10617-017-9183-y
https://doi.org/10.1007/s10617-017-9183-y
Publikováno v:
Natural Computing. 15:395-414
Heuristic search is one of the fundamental problem solving techniques in artificial intelligence, which is used in general to efficiently solve computationally hard problems in various domains, especially in planning and optimization. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5377531249a5847843d414ad4e293ff
https://doi.org/10.1007/s11047-015-9490-9
https://doi.org/10.1007/s11047-015-9490-9
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. 11:45-58
Fault-tolerance of embedded control systems is of great importance, given their wide usage in various domains such as aeronautics, automotive, medical, and so on. Signal perturbations such as small amounts of noise, shift, and spikes, can sometimes s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d89de388cf7ee4ec6048b1487bebdf5
https://doi.org/10.1109/tdsc.2013.23
https://doi.org/10.1109/tdsc.2013.23
Publikováno v:
Information Processing Letters. 113:888-893
Beam search is a heuristic search algorithm that explores a state-space graph by expanding w most promising nodes at each level (depth) of the graph, where w is called the beam-width which is taken as input from the user. The quality of the solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::460630c284c6f0754176b6cd8d2d1dd9
https://doi.org/10.1016/j.ipl.2013.08.010
https://doi.org/10.1016/j.ipl.2013.08.010
Formal Methods for Early Analysis of Functional Reliability in Component-Based Embedded Applications
Publikováno v:
IEEE Embedded Systems Letters. 5:8-11
We present formal methods for determining whether a set of components with given reliability certificates for specific functional properties are adequate to guarantee desired end-to-end properties with specified reliability requirements. We introduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f925d00976e76b1f26e36390be1f883
https://doi.org/10.1109/les.2013.2239605
https://doi.org/10.1109/les.2013.2239605
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 30
Finding diverse solutions has become important in many combinatorial search domains, including Automated Planning, Path Planning and Constraint Programming. Much of the work in these directions has however focussed on coming up with appropriate diver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2df6ddce8141342927433e980d829dbb
https://doi.org/10.1609/aaai.v30i1.10079
https://doi.org/10.1609/aaai.v30i1.10079
Publikováno v:
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). 41:725-735
This paper presents a heuristic-search algorithm called Memory-bounded Anytime Window A*(MAWA*), which is complete, anytime, and memory bounded. MAWA* uses the window-bounded anytime-search methodology of AWA* as the basic framework and combines it w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac685c82afd83081a2552ee24ec32596
https://doi.org/10.1109/tsmcb.2010.2089619
https://doi.org/10.1109/tsmcb.2010.2089619
Autor:
Nadathur Satish, Dipankar Das, Michael J. Anderson, Narayanan Sundaram, Vadim O. Pirogov, Md. Mostofa Ali Patwary, Satya Gautam Vadlamudi, Pradeep Dubey, Jongsoo Park, Sergey G. Pudov
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319201184
Sparse matrix-matrix multiplication (SpGEMM) is a key kernel in many applications in High Performance Computing such as algebraic multigrid solvers and graph analytics. Optimizing SpGEMM on modern processors is challenging due to random data accesses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49055238fd54909d93d2f36af30f2fdb
https://doi.org/10.1007/978-3-319-20119-1_4
https://doi.org/10.1007/978-3-319-20119-1_4
Autor:
Anshul Gupta, Sudeshna Sarkar, Nathan Gnanasambandam, Tridib Mukherjee, Satya Gautam Vadlamudi, Partha Chakrabarti, Aurosish Mishra
Publikováno v:
ICDM
We present a mobility simulation framework that simulates the movement behaviors of people to generate spatiotemporal movement data. There is a growing interest in applications that make use of patterns mined from spatio-temporal data. However, since
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a61572e71ed36d1fb33da3a00f9b977
https://doi.org/10.1109/icdm.2013.72
https://doi.org/10.1109/icdm.2013.72
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642450617
PReMI
PReMI
Heuristic search is a fundamental problem solving technique in artificial intelligence. In this paper, we propose an anytime heuristic search algorithm called Anytime Pack Search (APS) which helps in solving hard combinatorial search problems efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e651915f059dd560c109f942015d84ca
https://doi.org/10.1007/978-3-642-45062-4_88
https://doi.org/10.1007/978-3-642-45062-4_88