Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

11 articles for “P. Balasubramanie”

Set a search alert
Also matching:2 authors
Research ArticleOpen accessIn the author namesA Modified Key Partitioning for BigData Using MapReduce in HadoopGothai Ekambaram, Balasubramanie PalanisamyIn the period of BigData, massive amounts of structured and unstructured data are being created every day by a multitude of ever-present sources. BigData is complicated to work with and needs extremely parallel software executing on a huge number of computers. MapReduce is a current programming model that makes simpler writing distributed applications which manipulate BigData. In order to make … …Journal of Computer Science, Vol. 11, Issue 3 · 15 Apr 2015 · 6,858 accessesView PDFCite
Research ArticleOpen accessIn the author namesOperation of Enterprise Resource Planning System Implementation Compatibility Towards Technical AdvancementJ. Venkatesh, C. Aarthy, S. Thenmozhi, P. BalasubramanieThe Execution of ERP systems has been perplexing factor for many firms. Many establishments have accepted that the operation of ERP system is a massive hindrance until the flow of process is organized carefully. As information technology is booming its prerequisite for organizations to realize the prominence of technical advancement and compatibility in work environment. A complete review was done … …Journal of Computer Science, Vol. 9, Issue 2 · 1 Apr 2013 · 6,704 accessesView PDFCite
Research ArticleOpen accessIn the author namesHybridization of Genetic Algorithm with Parallel Implementation of Simulated Annealing for Job Shop SchedulingThamilselvan Rakkiannan, Balasubramanie PalanisamyProblem statement: The Job Shop Scheduling Problem (JSSP) is observed as one of the most difficult NP-hard, combinatorial problem. The problem consists of determining the most efficient schedule for jobs that are processed on several machines. Approach: In this study Genetic Algorithm (GA) is integrated with the parallel version of Simulated Annealing Algorithm (SA) is applied to the job shop … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 25 Aug 2012 · 7,056 accessesView PDFCite
Research ArticleOpen accessIn the author namesDynamic Scheduling for Cloud Reliability using Transportation ProblemS. K. Senthil Kumar, P. BalasubramanieProblem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliability and availability of the cloud … …Journal of Computer Science, Vol. 8, Issue 10 · 23 Aug 2012 · 8,332 accessesView PDFCite
Research ArticleOpen accessIn the author namesSentence Annotation based Enhanced Semantic Summary Generation from Multiple DocumentsA. Kogilavani, P. BalasubramanieProblem statement: The goal of document summarization is to provide a summary or outline of manifold documents with reduction in time. Sentence extraction could be a technique that is employed to pick out relevant and vital sentences from documents and presented as a summary. So there is a need to develop more meaningful sentence selection strategy so as to extract … …American Journal of Applied Sciences, Vol. 9, Issue 7 · 17 May 2012 · 7,001 accessesView PDFCite
Research ArticleOpen accessIn the author namesImproving the Attack Detection Rate in Network Intrusion Detection using Adaboost AlgorithmP. Natesan, P. Balasubramanie, G. GowrisonProblem statement: Nowadays, the Internet plays an important role in communication between people. To ensure a secure communication between two parties, we need a security system to detect the attacks very effectively. Network intrusion detection serves as a major system to work with other security system to protect the computer networks. Approach: In this article, an Adaboost algorithm for network … …Journal of Computer Science, Vol. 8, Issue 7 · 16 May 2012 · 7,461 accessesView PDFCite
Research ArticleOpen accessIn the author namesIntegration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange CrossoverR. Thamilselvan, P. BalasubramanieProblem statement: The problem of scheduling n jobs on m machines with each job having specific machine route has been researched over the decade. The Job Shop Scheduling (JSS) is one of the hardest combinatorial optimization problems. Each resource can process at most one job at a time. Approach: This study proposes a new approach to solve a Job Shop … …Journal of Computer Science, Vol. 8, Issue 5 · 24 Feb 2012 · 6,650 accessesView PDFCite
Research ArticleOpen accessIn the author namesAn Efficient Way for Clustering Using Alternative Decision TreeE. Gothai, P. BalasubramanieProblem statement: To Improve the quality of clustering; a Multi-Level Clustering (MLC) algorithm which produces a most accurate cluster with most closely related object using Alternative Decision Tree (ADT) technique is proposed. Approach: Our proposed method combines tree projection and condition for clustering formation and also is capable to produce a customizable cluster for varying kind of data along with … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 13 Feb 2012 · 6,739 accessesView PDFCite
Research ArticleOpen accessIn the author namesAn Efficient Hand-off Mechanism for Vehicular NetworksM. Dinakaran, P. BalasubramanieProblem statement: In recent times, wireless networks have become ubiquitous and the hotspot research arena. When a mobile node switches from one access network to another network, the node is said to perform a handoff. This transition is a complex and time-consuming task since after transit the mobile node has to obtain a new Care of Address (CoA) from the … …Journal of Computer Science, Vol. 8, Issue 1 · 3 Nov 2011 · 7,289 accessesView PDFCite
Research ArticleOpen accessIn the author namesCache Based Distributed Query Processing in Mobile Ad hoc NetworksT. P. Andamuthu, P. BalasubramanieProblem statement: In the last few years, the evolution of the mobile networks leads to the query processing in mobile computing an impressive research area. The mobile computing technology needs to offer more and different innovative services as the number of users of the mobiles were increasing. In this regard, this study proposed a new algorithm which increased the performance … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,758 accessesView PDFCite