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

79 articles for “selection algorithms”
Set a search alert
Also matching:1 special issue
Research ArticleOpen accessAll words, across the recordComputational Analysis of Genre Effects on Movie Ratings Using MLP AlgorithmsSubir Gupta, Upasana Adhikari, Shefali Varshney, Tanupriya ChoudhuryPredictive analytics are what the entertainment industry depends on so much in prognosticating movie ratings, which is why they inform filmmakers, distributors and stream platforms strategic moves. Traditional prediction models most times only succeed in missing out on the intricate dynamics that are genre-specific to movie ratings thereby leading to inaccuracies and suboptimal decision making. The paper proposes this research … …Journal of Computer Science, Vol. 21, Issue 4 · 19 Mar 2025 · 5,534 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordQUANTITATIVE EVALUATION OF JOB AND RESOURCES FOR BETTER SELECTION TO IMPROVE MAKESPAN IN GRID SCHEDULINGKrishnamoorthy Natarajan, Asokan Ramasamy, Sangeetha SubramanianThis study presents the Priority based ranking of jobs and resources to improve the Makespan in the grid scheduling problem. Grid environment’s effectiveness largely depends on scheduler’s effectiveness/efficiency as they act as local resource brokers. The scheduler is responsible to select resources/scheduling jobs so that users/application requirements are met regarding overall execution time (throughput) and the resources use cost. The … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,554 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordNelder-Mead Method with Local Selection Using Neighborhood and Memory for Stochastic OptimizationNoocharin Tippayawannakorn, Juta PichitlamkenWe consider the Nelder-Mead (NM) simplex algorithm for optimization of discrete-event stochastic simulation models. We propose new modifications of NM to reduce computational time and to improve quality of the estimated optimal solutions. Our means include utilizing past information of already seen solutions, expanding search space to their neighborhood and using adaptive sample sizes. We compare performance of these extensions … …Journal of Computer Science, Vol. 9, Issue 4 · 10 May 2013 · 6,121 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEnhanced Ensemble Prediction Algorithms for Detecting Faulty Modules in Object Oriented Systems Using Quality MetricsM. Punithavalli, C. NeelamegamThe high usage of software system poses high quality demand from users, which results in increased software complexity. To address these complexities, software quality engineering methods should be updated accordingly and enhance their quality assuring methods. Fault prediction, a sub-task of SQE, is designed to solve this issue and provide a strategy to identify faulty parts of a program, so … …Journal of Computer Science, Vol. 8, Issue 12 · 20 Dec 2012 · 6,435 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEnsuring Multi Messages Broadcasting in Mobile Ad Hoc Network using Network Coding ApproachS. V.M.G. Bavithiraja, R. RadhakrishnanProblem statement: In mobile adhoc network, broadcasting is a common operation for route establishment and for sending control and emergency messages. Most of the existing broadcasting algorithms consider broadcasting from single source node and consider only single message broadcasting. Initiating multiple messages broadcasting from multiple sources is a challenging task which requires minimum number of retransmission made by the forwarding … …Journal of Computer Science, Vol. 8, Issue 6 · 17 Mar 2012 · 7,055 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA Tool for Generation and Minimization of Test Suite by Mutant Gene AlgorithmSelvakumar Subramanian, Ramaraj NatarajanProblem statement: This study proposes a new idea for generation of minimized test suite in the test case generation using the mutant gene algorithm, which not only identifies the best test cases but also reduces the number of test cases generated, selects test cases optimally there improving the performance in testing of software. Test cases are generated by using branch … …Journal of Computer Science, Vol. 7, Issue 10 · 9 Aug 2011 · 7,164 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordImproving Term Extraction Using Particle Swarm Optimization TechniquesMohammad Syafrullah, Naomie SalimProblem statement: Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatically. The purpose of this process is to generate list of terms that are relevant to the domain of the input document. In the literature there are many approaches, techniques and algorithms … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,138 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEfficacious Geospatial Information Retrieval Using Density Probabilistic Document Correlation ApproachR. Uma, MuneeswaranInformation Retrieval (IR) is a profound technique to find information that addresses the need of query. Processing of normal text is easier and information can be retrieved efficiently. There are plenty of algorithms in hand to carry out the normal text retrieval. Whereas retrieving geospatial information is very complex and requires additional operations to be performed. Since geospatial data contain … …Journal of Computer Science, Vol. 9, Issue 1 · 16 Feb 2013 · 7,011 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordAn Iterative Method for Algorithms Implementation on a Limited Dynamically Reconfigurable HardwareAbdellatif Mtibaa, Abdessalem B. Abdelali, Lotfi Boussaid, Elbey BourennaneIn this study we propose a framework and a combined temporal partitioning and design space exploration method for run time reconfigurable processors. Our objective is to help designers to implement an algorithm in limited FPGA area resources while respecting the execution time constraint. The algorithm to be implemented is represented by a task graph with different implementation alternatives (design points) … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,536 accessesView PDFCite