Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Supachai Mukdasanit"'
Publikováno v:
Journal of Computer and System Sciences. 115:54-63
Let M = ( T , C , P ) be a security model, where T is a rooted tree, C is a multiset of costs and P is a multiset of prizes and let ( T , c , p ) be a security system, where c and p are bijections of costs and prizes. The problems of computing an opt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47f13693b57e6a281862c039e5ff12a7
https://doi.org/10.1016/j.jcss.2020.07.001
https://doi.org/10.1016/j.jcss.2020.07.001
Autor:
Supachai Mukdasanit
Publikováno v:
2018 22nd International Computer Science and Engineering Conference (ICSEC).
In this article, we propose a new defensive problem in a security system. Let S(T, c, p) be a security system, where T = (V, E) is a rooted tree rooted at r, c and p are assignment functions c: E(T) → ℤ+ and p: V(T) ∖ {r} → ℤ+, respectively
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f89fb043982c8f5d25774d859379cd4
https://doi.org/10.1109/icsec.2018.8712797
https://doi.org/10.1109/icsec.2018.8712797
Publikováno v:
2017 21st International Computer Science and Engineering Conference (ICSEC).
In this article we present a new defensive problem on a security system. Let M be a security model (T, C,P), where T= (V, E) is a rooted tree rooted at r,C is a multiset of E(T) costs and P is a multiset of V(T)-1 prizes and let (T, c,p) be a securit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::183cf276b2fae777c62f91a7f12f5b9e
https://doi.org/10.1109/icsec.2017.8443870
https://doi.org/10.1109/icsec.2017.8443870