Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Mahyus Ihsan"'
Publikováno v:
JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 7, Iss 2, Pp 522-532 (2023)
Maze is a place that has many paths with tortuous paths that are misleading and full of dead ends and can be viewed as a grid graph. A non-perfect maze is a maze that has a cycle. This research produces an algorithm that can form a non-perfect maze w
Externí odkaz:
https://doaj.org/article/64966afc779a447e9bfe15409054fd9f
Publikováno v:
Desimal, Vol 3, Iss 3, Pp 271-278 (2020)
In this article, we provided a numerical simulation for asymptotic normality of a kernel type estimator for the intensity obtained as a product of a periodic function with the power trend function of a nonhomogeneous Poisson Process. The aim of this
Externí odkaz:
https://doaj.org/article/1769bd5574144eb3ad91c2072e63bf72
Publikováno v:
Jurnal Natural, Vol 21, Iss 1 (2021)
A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biase
Externí odkaz:
https://doaj.org/article/5712a45c9aba47fb9459c4fe6d35d398
Publikováno v:
Jurnal Natural, Vol 16, Iss 1 (2016)
Adobe Flash is a software that is used to build an interactive contents that can be attached in other things, such as presentations, games and e-learning. The Eulerian Circuit Search Instructional Media is one of examples in using Adobe Flash in buil
Externí odkaz:
https://doaj.org/article/f1d1c2d7b7354575a6c1d3a7d3e1c10d
Publikováno v:
Jurnal Natural, Vol 14, Iss 1 (2014)
This paper discusses about connectivity algorithm in simple graphs. The algorithm has three stages, namely, adjacent vertices search, adjacent vertices investigation and component investigation. The aim of connectivity algorithm is to check whether a
Externí odkaz:
https://doaj.org/article/54af2ed4064945d89d96e845787bd784
Publikováno v:
Jurnal Natural, Vol 13, Iss 1 (2014)
Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization. Some graphs require the connectivity in their definitions, such as Hamiltonian graph, Eulerian
Externí odkaz:
https://doaj.org/article/4149ec9eb8fc46e4866b6ec95126d995
Publikováno v:
AIP Conference Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d643016aed54696ccf3d8e09e9233edf
https://doi.org/10.1063/5.0103432
https://doi.org/10.1063/5.0103432
Autor:
Sayuti Rahman, Marwan Ramli, Fitri Arnia, Rusdha Muharar, Haida Dafitri, null Dharmawati, Mahyus Ihsan
Publikováno v:
AIP Conference Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8303635deb5ee8a782e47fad5c16236
https://doi.org/10.1063/5.0103430
https://doi.org/10.1063/5.0103430
Publikováno v:
Desimal, Vol 3, Iss 3, Pp 271-278 (2020)
In this article, we provided a numerical simulation for asymptotic normality of a kernel type estimator for the intensity obtained as a product of a periodic function with the power trend function of a nonhomogeneous Poisson Process. The aim of this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dbcd767c84d1ce9d7f5b43b96cc8dfe
https://doi.org/10.24042/djm.v3i3.6374
https://doi.org/10.24042/djm.v3i3.6374
Publikováno v:
Jurnal Natural, Vol 21, Iss 1 (2021)
A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biase
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::662b3829180ae37e060bee3045ab7194
https://doi.org/10.24815/jn.v21i1.18840
https://doi.org/10.24815/jn.v21i1.18840