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

84 results for “Hybrid Algorithms”
Set a search alert
Research ArticleOpen accessIn the abstractNew Scaled Sufficient Descent Conjugate Gradient Algorithm for Solving Unconstraint Optimization ProblemsAbbas Y. AL-Bayati, Rafiq S. MuhammadProblem statement: The scaled hybrid Conjugate Gradient (CG) algorithm which usually used for solving non-linear functions was presented and was compared with two standard well-Known NAG routines, yielding a new fast comparable algorithm. Approach: We proposed, a new hybrid technique based on the combination of two well-known scaled (CG) formulas for the quadratic model in unconstrained optimization using exact line … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,046 accessesView PDFCite
Research ArticleOpen accessIn the abstractConvalesce Optimization for Input Allocation Problem Using Hybrid Genetic AlgorithmMamta Madan, Sushila MadanProblem statement: The purpose of this study was to describe categories of hybrid genetic algorithm and validate that the hybrid genetic algorithm converges to the optimal solution rather than a near optimal solution so that Hybrid Genetic algorithms can be used to solve real world problems and receive significant interest. Approach: We implemented the input allocation problem for a manufacturing … …Journal of Computer Science, Vol. 6, Issue 4 · 30 Apr 2010 · 7,005 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Scheduling Algorithm Based on Petri Nets and Simulated AnnealingRachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida, Hicham TebbikhThis study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,164 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybridization of Neural Learning Algorithms Using Evolutionary and Discrete Gradient ApproachesRanadhir Ghosh, John Yearwood, Moumita Ghosh, Adil BagirovIn this study we investigated a hybrid model based on the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. Also we discuss different variants for hybrid models using the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. The Discrete Gradient … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,587 accessesView PDFCite
Research ArticleOpen accessIn the abstractINJECT AN ELASTIC GRID COMPUTING TECHNIQUES TO OPTIMAL RESOURCE MANAGEMENT TECHNIQUE OPERATIONSR. Surendran, B. Parvatha VarthiniEvaluation of sharing on the Internet well- developed from energetic technique of grid computing. Dynamic Grid Computing is Resource sharing in large level high performance computing networks at worldwide. Existing systems have a Limited innovation for resource management process. In proposed work, Grid Computing is an Internet based computing for Optimal Resource Management Technique Operations (ORMTO). ORMTO are Elastic scheduling … …Journal of Computer Science, Vol. 9, Issue 8 · 9 Jul 2013 · 6,736 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced RSACRT for Energy Efficient Authentication to Wireless Sensor Networks SecurityP. Kalyani, C. ChellappanProblem statement: The Security in WSN has become a challenge because of its inherent limitations of resources imposed on the sensor nodes. Authentication and key management scheme allows WSNs to be used with confidence and maintains integrity of data in sensor networks. Approach: In the WSN limited resource scenario the generation of public key done and are randomly pre distributed … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 18 Aug 2012 · 7,339 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Memetic Algorithm for VLSI Circuit Partitioning Problem using Graphical Processing UnitsP. Subbaraj, P. SivakumarProblem statement: Memetic Algorithm (MA) is a form of population-based hybrid Genetic Algorithm (GA) coupled with an individual learning procedure capable of performing local refinements. Here we used genetic algorithm to explore the search space and simulated annealing as a local search method to exploit the information in the search region for the optimization of VLSI netlist bi-Partitioning problem. However, … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 7,090 accessesView PDFCite
Research ArticleOpen accessIn the abstractSoft Computing in Optimizing Assembly Lines BalancingMuhammad Zaini Matondang, Muhammad Ikhwan JambakAs part of manufacturing systems, the assembly line has become one of the most valuable researches to accomplish the real world problems related to them. Many efforts have been made to seek the best techniques in optimizing assembly lines. Problem statement: Since it was published by Salveson in 1955, some methods and techniques have been developed based on mathematical modeling. … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,469 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Parallel Maximal Cliques Algorithm for Protein Sequence ClusteringKhalid Jaber, Nur’Aini Abdul Rashid, Rosni AbdullahProblem statement: Protein sequence clustering is a method used to discover relations between proteins. This method groups the proteins based on their common features. It is a core process in protein sequence classification. Graph theory has been used in protein sequence clustering as a means of partitioning the data into groups, where each group constitutes a cluster. Mohseni-Zadeh introduced a … …American Journal of Applied Sciences, Vol. 6, Issue 7 · 31 Jul 2009 · 7,100 accessesView PDFCite
Research ArticleOpen accessIn the abstractRandom Graph Generation Based p-Method and Box Method for the Evaluation of Power-Aware Routing Protocols of Ad hoc NetworksSaleh H. Al-SharaehThe objective of this paper is to investigate the best solution such that on which decision should be made to forward a wireless packet. The decision should be made in such a way to keep the node alive by choosing an alternate path, through those nodes that have more power reserve. Minimizing the consumption of the reserve power will results … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 6,762 accessesView PDFCite