![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
A. Charan Kumari
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Neeti Kashyap, Rita Rana Chhikara, A. Charan Kumari:
Multi-objective metaheuristic search algorithms for service composition in IoT. Int. J. Intell. Eng. Informatics 10(3): 242-270 (2022) - [j11]Prerna Singal
, Prabha Sharma, A. Charan Kumari:
Integrating software effort estimation with risk management. Int. J. Syst. Assur. Eng. Manag. 13(5): 2413-2428 (2022) - 2021
- [j10]Hitesh Yadav, Rita Rana Chhikara, A. Charan Kumari:
A novel hybrid approach for feature selection in software product lines. Multim. Tools Appl. 80(4): 4919-4942 (2021) - 2020
- [j9]Neeti Kashyap
, A. Charan Kumari, Rita Rana Chhikara:
Service Composition in IoT using Genetic algorithm and Particle swarm optimization. Open Comput. Sci. 10(1): 56-64 (2020) - [j8]Hitesh Yadav, A. Charan Kumari, Rita Rana Chhikara:
Feature selection optimisation of software product line using metaheuristic techniques. Int. J. Embed. Syst. 13(1): 50-64 (2020)
2010 – 2019
- 2019
- [j7]Mohit, A. Charan Kumari, Meghna Sharma:
A novel approach to text clustering using shift k-medoid. Int. J. Soc. Comput. Cyber Phys. Syst. 2(2): 106-118 (2019) - [j6]Ram Sharma, A. Charan Kumari
, Mona Aggarwal, Swaran Ahuja:
Down-link performance of an LED based visible light communication system through dynamic control of semi-angle. Phys. Commun. 33: 222-230 (2019) - 2018
- [j5]Neeti Kashyap, A. Charan Kumari:
Hyper-heuristic approach for service composition in internet of things. Electron. Gov. an Int. J. 14(4): 321-339 (2018) - [j4]Ram Sharma, A. Charan Kumari
, Mona Aggarwal
, Swaran Ahuja:
Hyperheuristic-based analysis and optimization of a mobile indoor visible light communication system. Trans. Emerg. Telecommun. Technol. 29(2) (2018) - [j3]Ram Sharma, A. Charan Kumari
, Mona Aggarwal, Swaran Ahuja:
Improved RMS delay and optimal system design of LED based indoor mobile visible light communication system. Phys. Commun. 28: 89-96 (2018) - 2016
- [j2]A. Charan Kumari
, K. Srinivas:
Comparing the performance of quantum-inspired evolutionary algorithms for the solution of software requirements selection problem. Inf. Softw. Technol. 76: 31-64 (2016) - [j1]A. Charan Kumari
, K. Srinivas:
Hyper-heuristic approach for multi-objective software module clustering. J. Syst. Softw. 117: 384-401 (2016) - 2012
- [c1]A. Charan Kumari
, K. Srinivas, M. P. Gupta:
Software Requirements Optimization Using Multi-Objective Quantum-Inspired Hybrid Differential Evolution. EVOLVE 2012: 107-120
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint