default search action
Ravneil Nand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Ravneil Nand
, Emmenual Reddy
Preference-Based Stepping Ahead Firefly Algorithm for Solving Real-World Uncapacitated Examination Timetabling Problem. IEEE Access 12: 24685-24699 (2024) - [j4]Ravneil Nand
Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm. IEEE Access 12: 26655-26666 (2024) - [j3]Ravneil Nand
Discrete Preference-Based Stepping Ahead Firefly Algorithm for Solving Multidimensional Knapsack Problems. IEEE Access 12: 139154-139164 (2024) - 2022
- [j2]Ravneil Nand, Bibhya Sharma
An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling. PeerJ Comput. Sci. 8: e1068 (2022) - [c13]Ravneil Nand:
A Preference-based Stepping ahead Artificial Bee Colony Algorithm for Global Optimization. PACIS 2022: 138 - 2021
- [j1]Ravneil Nand
Stepping ahead Firefly Algorithm and hybridization with evolution strategy for global optimization problems. Appl. Soft Comput. 109: 107517 (2021) - [c12]Ravneil Nand
Data Mining Students' performance in a Higher Learning Environment. NILES 2021: 241-245 - 2020
- [c11]Ravneil Nand
Stepping ahead based hybridization of meta-heuristic model for solving Global Optimization Problems. CEC 2020: 1-8
2010 – 2019
- 2019
- [c10]Ravneil Nand
Meta-heuristic approaches to tackle Skill Based Group allocation of Students in Project Based Learning Courses. CEC 2019: 1782-1789 - 2018
- [c9]Ravneil Nand
Skill-Based Group Allocation of Students for Project-Based Learning Courses Using Genetic Algorithm: Weighted Penalty Model. TALE 2018: 394-400 - [c8]Ravneil Nand
Skill-Based Group Allocation of Students for Project-Based Learning Courses Using Genetic Algorithm: Weightless Penalty Model. TALE 2018: 431-437 - [c7]Bibhya Nand Sharma
Smart Learning in the Pacific: Design of New Pedagogical Tools. TALE 2018: 573-580 - 2016
- [c6]Ravneil Nand
Competitive Island Cooperative Neuro-evolution of Feedforward Networks for Time Series Prediction. ACALCI 2016: 160-170 - [c5]Ravneil Nand
Reverse Neuron Level Decomposition for Cooperative Neuro-Evolution of Feedforward Networks for Time Series Prediction. ACALCI 2016: 171-182 - [c4]Ravneil Nand
Coevolutionary Feature Selection and Reconstruction in Neuro-Evolution for Time Series Prediction. ACALCI 2016: 285-297 - [c3]Ravneil Nand
Neuron-synapse level problem decomposition method for cooperative coevolution of recurrent networks for time series prediction. CEC 2016: 3102-3109 - [c2]Ravneil Nand
Neuron-Network Level Problem Decomposition Method for Cooperative Coevolution of Recurrent Networks for Time Series Prediction. ICONIP (3) 2016: 38-48 - 2015
- [c1]Ravneil Nand
Neuron-Synapse Level Problem Decomposition Method for Cooperative Neuro-Evolution of Feedforward Networks for Time Series Prediction. ICONIP (3) 2015: 90-100
Coauthor Index
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-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: