Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Ludwig Kampel"'
Publikováno v:
IEEE Access, Vol 10, Pp 18787-18806 (2022)
This paper presents a novel method for locating combinational hardware Trojans (HT) based on fault location approaches used in combinatorial testing. This method relies exclusively on the combinatorial properties of the executed test vectors and the
Externí odkaz:
https://doaj.org/article/c5c778b8d3a84b868bbe20721af145d9
Publikováno v:
Journal of Combinatorial Designs. 31:205-261
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8813b29fd84268f10015bd8f32c6d84
https://doi.org/10.1002/jcd.21876
https://doi.org/10.1002/jcd.21876
Autor:
Ludwig Kampel, Michael Wagner, Dimitris E. Simos, Mihai Nica, Dino Dodig, David Kaufmann, Franz Wotawa
Publikováno v:
2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cc011a68b4ad8d151084b6ff77fa33d
https://doi.org/10.1109/icstw58534.2023.00049
https://doi.org/10.1109/icstw58534.2023.00049
Publikováno v:
2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::252eea853f13b18c2929bbc589a647a8
https://doi.org/10.1109/icstw58534.2023.00052
https://doi.org/10.1109/icstw58534.2023.00052
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 15:288-290
Covering arrays (CAs) are discrete objects appearing in combinatorial design theory that find practical applications, most prominently in software testing. The generation of optimized CAs is a difficult combinatorial optimization problem being subjec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89278ae4401090812655ae1883c4dc08
https://doi.org/10.1609/socs.v15i1.21788
https://doi.org/10.1609/socs.v15i1.21788
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 90:951-964
We briefly review properties of explainable AI proposed by various researchers. We take a structural approach to the problem of explainable AI, examine the feasibility of these aspects and extend them where appropriate. Afterwards, we review combinat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ffc7a908c9f0e17c9f7d8f8d1b501d8
https://doi.org/10.1007/s10472-021-09772-0
https://doi.org/10.1007/s10472-021-09772-0
Publikováno v:
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::534049d138311654ea3c534bbd7120e3
https://doi.org/10.1109/synasc57785.2022.00021
https://doi.org/10.1109/synasc57785.2022.00021
Publikováno v:
Optimization Methods and Software. 37:1165-1202
In the past, combinatorial structures have been used only to tune parameters of neural networks. In this work, we employ neural networks in the form of Boltzmann machines and Hopfield networks for ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f426971ae15d879558122d2660705981
https://doi.org/10.1080/10556788.2021.1907384
https://doi.org/10.1080/10556788.2021.1907384
Publikováno v:
Theoretical Computer Science. 800:90-106
In this paper, we explore some connections between covering arrays (CAs) and set covers (SCs) that already existed in the literature, and in some cases we provide new mappings between these structures. In particular, the devised mappings make feasibl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adb14ee698de61ea62ba5daca499cc6c
https://doi.org/10.1016/j.tcs.2019.10.018
https://doi.org/10.1016/j.tcs.2019.10.018
Autor:
Ludwig Kampel, Dimitris E. Simos
Publikováno v:
Theoretical Computer Science. 800:107-124
In this paper, a first systematic review and analysis of the current state of the art pertaining to complexity problems for a heavily researched class of designs, namely covering arrays, is presented. In addition to surveying all known complexity res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3206e0b62026d529582c4f5f15808782
https://doi.org/10.1016/j.tcs.2019.10.019
https://doi.org/10.1016/j.tcs.2019.10.019