Zobrazeno 1 - 10
of 111
pro vyhledávání: '"B. Praba"'
Publikováno v:
Neutrosophic Sets and Systems, Vol 55, Pp 13-36 (2023)
Face-on-Face interaction constitutes an integral part of the classroom atmosphere as it provides teachers with an opportunity to understand their students intimately. Hence, this study deals with attribute based double bounded rough neutrosophic set
Externí odkaz:
https://doaj.org/article/22cc0189405b4b94855533ea1f1140a5
Publikováno v:
Neutrosophic Sets and Systems, Vol 49, Pp 324-340 (2022)
In this paper, a hybrid intelligent structure called “Double Bounded Rough Neutrosophic Sets” is defined, which is a combination of Neutrosophic sets theory and Rough sets theory. Further, the Attribute based Double Bounded Rough Neutrosophic Set
Externí odkaz:
https://doaj.org/article/321a1b3b075f40448305a876673628ba
Publikováno v:
Journal of Mathematics, Vol 2023 (2023)
Encryption and decryption are the two processes in cryptography to conceal and convey important information to an authorized person without third-party interruption in a network. Cryptography is a branch of computer science in which the system has to
Externí odkaz:
https://doaj.org/article/84b67c9e584142b793b2a808ab7783b1
Autor:
B. Praba, G. Gomathi
Publikováno v:
New Mathematics and Natural Computation. 18:293-311
In this work, authors introduce a novel rough set called hypergraph rough set using the minimal soft description. A relation [Formula: see text] on the set of all hypergraph rough sets T is defined and theoretically proved that [Formula: see text] is
Autor:
B. Praba, M. Logeshwari
Publikováno v:
New Mathematics and Natural Computation. :1-15
In view of this paper, we have defined Rough Co-zero divisor graph [Formula: see text] of a rough semiring [Formula: see text] for a given approximation space [Formula: see text] where [Formula: see text] is nonempty finite set of objects and [Formul
Autor:
R. Saranya, B. Praba
Publikováno v:
New Mathematics and Natural Computation. 18:147-162
The scope of this paper is to make the best use of cellular automaton. It is important that they can simulate not just a discrete model but also used to solve practical problems. To stimulate the research in this field, we define Fuzzy Graph Cellular
Autor:
B. Praba, R. Saranya
Publikováno v:
Revista Gestão Inovação e Tecnologias. 11:629-641
Objective: The study of finite state automaton is an essential tool in machine learning and artificial intelligence. The class of rough finite state automaton captures the uncertainty using the rough transition map. The need to generalize this concep
Publikováno v:
Advances in Mathematics: Scientific Journal. 10:1915-1923
Autor:
R. Saranya, B. Praba
Publikováno v:
Advances in Mathematics: Scientific Journal. 10:1591-1602
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:6855-6861