Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Sanpawat Kantabutra"'
Autor:
Sanpawat Kantabutra
Publikováno v:
PeerJ Computer Science, Vol 10, p e2499 (2024)
In many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items. In the worst case a deterministic algorithm must scan n−k items in the
Externí odkaz:
https://doaj.org/article/0503723bac6d4fe48b0de6b5986da1a8
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
Autor:
Sanpawat Kantabutra
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811995811
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b719d0ad16a26834ebf1f899d0f3297
https://doi.org/10.1007/978-981-19-9582-8_9
https://doi.org/10.1007/978-981-19-9582-8_9
Autor:
Sanpawat Kantabutra, Nopadon Juneam
Publikováno v:
Fundamenta Informaticae. 150:211-220
Publikováno v:
Acta Cybernetica. 22:591-612
This paper makes three contributions to cyber-security research. First,we define a model for cyber-security systems and the concept of acyber-security attack within the model's framework. The modelhighlights the importance of game-over components - c
Publikováno v:
Acta Cybernetica. 22:735-769
In this paper we consider the structure and topology of a layered-security model in which the containers and their nestings are given in the form of a rooted tree T. A cyber-security model is an ordered three-tuple M = (T, C, P) where C and P are mul
Autor:
Sanpawat Kantabutra
Publikováno v:
International Journal of Foundations of Computer Science. 26:33-50
Given an undirected, connected, simple graph G = (V,E), two vertex labelings LV and L'V of the vertices of G, and a label flip operation that interchanges a pair of labels on adjacent vertices, the Vertex Relabeling Problem is to transform G from LV
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
Autor:
Raymond Greenlaw, Sanpawat Kantabutra
Publikováno v:
International Journal of Information Retrieval Research. 3:1-29
This article is a survey into clustering applications and algorithms. A number of important well-known clustering methods are discussed. The authors present a brief history of the development of the field of clustering, discuss various types of clust
Publikováno v:
Networks. 59:320-330
Wireless communication has become omnipresent in the world and enables users to have an unprecedented ability to communicate any time and any place. In this article, we propose a mobility model for studying wireless communication. The model incorpora