Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Kumar S. Ray"'
Autor:
Rajesh Misra, Kumar S. Ray
Publikováno v:
Multimedia Tools and Applications.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e1c246a39d5e1b295c246a79fa47567
https://doi.org/10.1007/s11042-023-15180-9
https://doi.org/10.1007/s11042-023-15180-9
Autor:
Mandrita Mondal, Kumar S. Ray
Publikováno v:
Handbook of Intelligent Computing and Optimization for Sustainable Development. :13-48
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38501c2f770d8ffdddceb29f254a1772
https://doi.org/10.1002/9781119792642.ch2
https://doi.org/10.1002/9781119792642.ch2
Autor:
Rajesh Misra, Kumar S. Ray
Publikováno v:
Multimedia Tools and Applications.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1621b9dd530f5629faf24b49c331c8a
https://doi.org/10.1007/s11042-023-14343-y
https://doi.org/10.1007/s11042-023-14343-y
Autor:
Litan Kumar Das, Kumar S. Ray
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 89:409-429
The paper explores categorical interconnections between lattice-valued relational systems and algebras of Fitting’s lattice-valued modal logic. We define lattice-valued Boolean systems, and then we study adjointness and co-adjointness of functors d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7580031b48528dc4a8eb8658d2aa9948
https://doi.org/10.1007/s10472-020-09707-1
https://doi.org/10.1007/s10472-020-09707-1
Autor:
Kumar S. Ray, Mandrita Mondal
Publikováno v:
New Mathematics and Natural Computation. 16:231-254
In this paper, we propose a wet lab algorithm for prediction of visibility under radiation fog by DNA computing. The model is based on a concept of similarity based fuzzy reasoning suitable for wet lab implementation. The concept of similarity based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ba88aa6401a9f59a3f9d3fb9e0a6ae4
https://doi.org/10.1142/s1793005720500143
https://doi.org/10.1142/s1793005720500143
Autor:
Kumar S. Ray, Litan Kumar Das
Publikováno v:
Acta Informatica. 58:571-584
In this paper, we investigate a bitopological duality for algebras of Fitting’s multi-valued logic. We also extend the natural duality theory for $$\mathbb {ISP_I}(\mathcal {L})$$ by developing a duality for $$\mathbb {ISP}(\mathcal {L})$$ , where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77102002f5f1fd7109924fc7cf22c51f
https://doi.org/10.1007/s00236-020-00384-5
https://doi.org/10.1007/s00236-020-00384-5
Autor:
Kumar S. Ray, Prithwineel Paul
Publikováno v:
Theoretical Computer Science. 816:19-36
In this paper, we associate the idea of derivation languages with a restricted variant of flat splicing systems where at each step splicing is done with an element from the initial set of words present in the system. We call these flat splicing syste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89246129929b1c5d1fc034f056ff72ba
https://doi.org/10.1016/j.tcs.2019.10.003
https://doi.org/10.1016/j.tcs.2019.10.003
Publikováno v:
Acta Informatica. 58:231-240
One-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21959d388b34d96593ede0d9961eb5a7
https://doi.org/10.1007/s00236-020-00370-x
https://doi.org/10.1007/s00236-020-00370-x
Autor:
Kumar S. Ray
Publikováno v:
Artificial Intelligence-Latest Advances, New Paradigms and Novel Applications
This chapter essentially makes a non-elusive attempt in quest of ‘I’ (Intelligence) in ‘AI’ (Artificial Intelligence). In the year 1950, Alan Turing proposed “the imitation game” which was a gaming problem to make a very fundamental quest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1025a9cce5c6f00357203941bd02418d
https://doi.org/10.5772/intechopen.96324
https://doi.org/10.5772/intechopen.96324
Autor:
Kingshuk Chatterjee, Kumar S. Ray
Publikováno v:
Theoretical Computer Science. 782:107-112
We introduce unary Watson-Crick automata and show that the set of all languages accepted by unary Watson-Crick automata is at most equal to the set of languages accepted by one counter automata and is a proper superset of the set of all regular langu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ea2a319c922048dd9476be64bd1aa6a
https://doi.org/10.1016/j.tcs.2019.03.009
https://doi.org/10.1016/j.tcs.2019.03.009