Pramod Kumar Sethy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pramod Kumar Sethy has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Erzsébet Csuhaj-Varjú
Department of Algorithms and Their Applications, Faculty of Informatics, ELTE Eötvös Loránd University, Budapest, Hungary
2 shared publications - Abhishek Guru
KL Deemed to be University
1 shared publication - Artiom Alhazov
State University of Moldova, Vladimir Andrunachievici Institute of Mathematics and Computer Science, Chişinău, Moldova
1 shared publication Bibhudatta Sahoo
National Institute of Technology Rourkela
1 shared publicationChinmaya Kumar Swain
SRM University-AP
1 shared publication- Sambit Kumar Mishra
Department of Computer Science and Engineering, SRM University-AP, Amaravati, India
1 shared publication
Latest Publications
- Open Access
- 3 April 2025
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 7 (4) , 377-390
Length-driven communication in networks of evolutionary processors
In this paper, we introduce a new method of filtering strings before communication in networks of evolutionary processors which is based on whether the length of strings at the given node increases, decreases, or remains unchanged after an evolutionary step is performed. This filtering mechanism differs from the usual ones, where context conditions are considered, as it is based only on quantitative conditions (the lengths of the strings) and does not take into account qualitative properties of the string to be communicated. We prove that any recursively enumerable language can be obtained as the language of a variant of hybrid networks of evolutionary processors with this new communication mode. We also show how two well-known NP-complete problems can be solved by the new model in linear time.
- 3 April 2025
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 7 (4) , 377-390
Open AccessLength-driven communication in networks of evolutionary processors
In this paper, we introduce a new method of filtering strings before communication in networks of evolutionary processors which is based on whether the length of strings at the given node increases, decreases, or remains unchanged after an evolutionary step is performed. This filtering mechanism differs from the usual ones, where context conditions are considered, as it is based only on quantitative conditions (the lengths of the strings) and does not take into account qualitative properties of the string to be communicated. We prove that any recursively enumerable language can be obtained as the language of a variant of hybrid networks of evolutionary processors with this new communication mode. We also show how two well-known NP-complete problems can be solved by the new model in linear time.
- 1 November 2024
- Published by Moldova State University in Computer Science Journal of Moldova
- Vol. 32 (3(96)) , 315-331
Generalized Distributed Reaction Systems
In this paper, we introduce the notion of a generalized distributed reaction system with computations following the concept of the original reaction system: the resulting products in the individual components are obtained by applying rules which take into account the objects in the components of the system as reactants and inhibitors and yield results in specified components of the system. As specific variants, we investigate (i) generalized distributed reaction systems which look at all components for the presence or absence of objects, but the resulting products are only produced in the component the rule is assigned to as well as (ii) generalized distributed reaction systems which look for the presence or absence of objects only in the component the rule is assigned to, but the resulting products can be sent to specified components within the whole system. We first show how all these variants of generalized distributed reaction systems can be flattened to a reaction system having only one component. Moreover, we show how each of these two variants, which are restricted variants of the general model, can simulate even the general model. Finally, we prove that all these variants of generalized distributed reaction systems working with the standard, total parallel application of rules can be transferred into a usual reaction system working with the sequential application of rules.
- 1 November 2024
- Published by Moldova State University in Computer Science Journal of Moldova
- Vol. 32 (3(96)) , 315-331
Generalized Distributed Reaction Systems
In this paper, we introduce the notion of a generalized distributed reaction system with computations following the concept of the original reaction system: the resulting products in the individual components are obtained by applying rules which take into account the objects in the components of the system as reactants and inhibitors and yield results in specified components of the system. As specific variants, we investigate (i) generalized distributed reaction systems which look at all components for the presence or absence of objects, but the resulting products are only produced in the component the rule is assigned to as well as (ii) generalized distributed reaction systems which look for the presence or absence of objects only in the component the rule is assigned to, but the resulting products can be sent to specified components within the whole system. We first show how all these variants of generalized distributed reaction systems can be flattened to a reaction system having only one component. Moreover, we show how each of these two variants, which are restricted variants of the general model, can simulate even the general model. Finally, we prove that all these variants of generalized distributed reaction systems working with the standard, total parallel application of rules can be transferred into a usual reaction system working with the sequential application of rules.
- 28 June 2023
- Published by Springer Nature
- p. 49-58
CS-Based Energy-Efficient Service Allocation in Cloud
- 28 June 2023
- Published by Springer Nature
- p. 49-58
CS-Based Energy-Efficient Service Allocation in Cloud