Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Shuji Kijima"'
Publikováno v:
IEEE Access, Vol 11, Pp 8240-8253 (2023)
With the development of IoT devices, there is a rapid increase in new types of IoT malware and variants, causing social problems. The malware’s phylogenetic tree has been used in many studies for malware clustering or better understanding of malwar
Externí odkaz:
https://doaj.org/article/6d106bc6fbe343768337ee0142d27fb3
Autor:
Shuji Kijima, Tomomi Matsui
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
In this paper, we are concerned with random sampling of an n dimensional integral point on an $(n-1)$ dimensional simplex according to a multivariate discrete distribution. We employ sampling via Markov chain and propose two "hit-and-run'' chains, on
Externí odkaz:
https://doaj.org/article/e954d64f97d9451b964cb1c7cb5c145f
Autor:
Shang Lu, Shuji Kijima
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:5133-5140
Jan-ken, a.k.a. rock-paper-scissors, is a cerebrated example of a non-transitive game with three (pure) strategies, rock, paper and scissors. Interestingly, any Jan-ken generalized to four strategies contains at least one useless strategy unless it a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b60ce41317170f578e335dec1ca3ed7a
https://doi.org/10.1609/aaai.v36i5.20447
https://doi.org/10.1609/aaai.v36i5.20447
Publikováno v:
Theoretical Computer Science. 887:11-29
The graph search problem is the problem of searching for a mobile evader in a dark cave by a group of mobile searchers, where the cave is modeled by an undirected connected graph G. An offline and centralized version of the graph search problem is fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fff63aebf06f31e242114ca83ed73fb4
https://doi.org/10.1016/j.tcs.2021.06.042
https://doi.org/10.1016/j.tcs.2021.06.042
Autor:
Takeharu Shiraga, Shuji Kijima
Analysis of algorithms on time-varying networks (often called evolving graphs) is a modern challenge in theoretical computer science. The edge-Markovian is a relatively simple and comprehensive model of evolving graphs: every pair of vertices which i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f89a68eabdf222fe11b1dd795c8ab5e5
http://arxiv.org/abs/2208.12130
http://arxiv.org/abs/2208.12130
Autor:
Shuji Kijima, Tomohito Fujii
Publikováno v:
Operations Research Letters. 49:1-4
M ♮ -concavity is a key concept in discrete convex analysis. For set functions, the class of M ♮ -concavity is a proper subclass of submodularity. It is a well-known fact that the set of minimizers of a submodular function forms a distributive la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9b22c29d191a5a4bbacfdeb980b3286
https://doi.org/10.1016/j.orl.2020.10.012
https://doi.org/10.1016/j.orl.2020.10.012
Publikováno v:
2021 Sixth International Conference on Fog and Mobile Edge Computing (FMEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f307217d442cd1c6ef7bf0ff3ef8c267
https://doi.org/10.1109/fmec54266.2021.9732550
https://doi.org/10.1109/fmec54266.2021.9732550
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1334-1343
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::450c5407b3546d95e0f3264020097d69
https://doi.org/10.1587/transfun.e101.a.1334
https://doi.org/10.1587/transfun.e101.a.1334
Publikováno v:
Theoretical Computer Science. 721:27-41
We investigate the team assembling problem for a swarm of heterogeneous mobile robots which requires the robots to autonomously partition themselves into teams satisfying a given specification A = ( a 1 , a 2 , … , a k ) , where a i is the number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fac56562945ff76ca3e72cc46a266791
https://doi.org/10.1016/j.tcs.2018.01.009
https://doi.org/10.1016/j.tcs.2018.01.009