Nickolas Savarimuthu
Nickolas Savarimuthu
Professor of Computer Applications, N.I.T., Trichy-15
Verified email at - Homepage
Cited by
Cited by
A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems
S Karthikeyan, P Asokan, S Nickolas, T Page
International Journal of Bio-Inspired Computation 7 (6), 386-401, 2015
A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints
S Karthikeyan, P Asokan, S Nickolas
The International Journal of Advanced Manufacturing Technology 72, 1567-1579, 2014
SVM ranking with backward search for feature selection in type II diabetes databases
S Balakrishnan, R Narayanaswamy, N Savarimuthu, R Samikannu
2008 IEEE International Conference on Systems, Man and Cybernetics, 2628-2633, 2008
Metaheuristic algorithms and probabilistic behaviour: a comprehensive analysis of Ant Colony Optimization and its variants
A Prakasam, N Savarimuthu
Artificial Intelligence Review 45, 97-130, 2016
Application based brokering algorithm for optimal resource provisioning in multiple heterogeneous clouds
T Subramanian, N Savarimuthu
Vietnam Journal of Computer Science 3, 57-70, 2016
ESKEA: enhanced symmetric key encryption algorithm based secure data storage in cloud networks with data deduplication
S Elkana Ebinazer, N Savarimuthu, S Mary Saira Bhanu
Wireless Personal Communications 117, 3309-3325, 2021
DPD-DS for plant disease detection based on instance segmentation
R Kavitha Lakshmi, N Savarimuthu
Journal of Ambient Intelligence and Humanized Computing 14 (4), 3145-3155, 2023
Cloud service evaluation and selection using fuzzy hybrid MCDM approach in marketplace
T Subramanian, N Savarimuthu
International Journal of Fuzzy System Applications (IJFSA) 5 (2), 118-153, 2016
Enhancing the performance of LIBSVM classifier by kernel f-score feature selection
B Sarojini, N Ramaraj, S Nickolas
Contemporary Computing: Second International Conference, IC3 2009, Noida …, 2009
Metaheuristic algorithms and polynomial turing reductions: A case study based on ant colony optimization
A Prakasam, N Savarimuthu
Procedia Computer Science 46, 388-395, 2015
A conditional tree based novel algorithm for high utility itemset mining
C Ramaraju, N Savarimuthu
2011 International Conference on Recent Trends in Information Technology …, 2011
Solving flexible job-shop scheduling problem using hybrid particle swarm optimisation algorithm and data mining
S Karthikeyan, P Asokan, S Nickolas, T Page
International journal of manufacturing technology and management 26 (1-4 …, 2012
Clustering based imputation algorithm using unsupervised neural network for enhancing the quality of healthcare data
K Shobha, N Savarimuthu
Journal of Ambient Intelligence and Humanized Computing 12 (2), 1771-1781, 2021
Novel local restart strategies with hyper-populated ant colonies for dynamic optimization problems
A Prakasam, N Savarimuthu
Neural Computing and Applications 31, 63-76, 2019
A study on optimized resource provisioning in federated cloud
T Subramanian, N Savarimuthu
arXiv preprint arXiv:1503.03579, 2015
An efficient secure data deduplication method using radix trie with bloom filter (SDD-RT-BF) in cloud environment
SE Ebinazer, N Savarimuthu
Peer-to-Peer Networking and Applications 14, 2443-2451, 2021
An unsupervised neural network approach for imputation of missing values in univariate time series data
N Savarimuthu, S Karesiddaiah
Concurrency and Computation: Practice and experience 33 (9), e6156, 2021
Fuzzy based quantum genetic algorithm for project team formation
A Pitchai, AV Reddy, N Savarimuthu
International Journal of Intelligent Information Technologies (IJIIT) 12 (1 …, 2016
PLDD—a deep learning-based plant leaf disease detection
RK Lakshmi, N Savarimuthu
IEEE Consumer Electronics Magazine 11 (3), 44-49, 2021
Quantum Walk based genetic algorithm for 0–1 quadratic knapsack problem
A Pitchai, AV Reddy, N Savarimuthu
2015 International Conference on Computing and Network Communications …, 2015
The system can't perform the operation now. Try again later.
Articles 1–20