Research ArticleOpen accessIn the keywordsAdaptive Acceptance Criterion (AAC) Algorithm for Optimization ProblemsAnmar AbuhamdahOptimization methods commonly are designed for solving the optimization problems. Local search algorithms are optimization method, which are good candidate in exploiting the search space. However, most of them need parameter tuning and incapable of escaping from local optima. This work proposes non-parametric Acceptance Criterion (AC) that not relies on user-defined, which motivate to propose an Adaptive Acceptance Criterion (AAC). … …Journal of Computer Science, Vol. 11, Issue 4 · 23 Jul 2015 · 6,969 accessesView PDFCite
Research ArticleOpen accessIn the keywordsParallel 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 keywordsFeature Selection for High Dimensional Data: An Evolutionary Filter ApproachAnwar Ali Yahya, Addin Osman, Abd Rahman Ramli, Adlan BalolaProblem statement: Feature selection is a task of crucial importance for the application of machine learning in various domains. In addition, the recent increase of data dimensionality poses a severe challenge to many existing feature selection approaches with respect to efficiency and effectiveness. As an example, genetic algorithm is an effective search algorithm that lends itself directly to feature selection; … …Journal of Computer Science, Vol. 7, Issue 5 · 9 May 2011 · 7,946 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Shortest Path with Intelligent AlgorithmSurachai PanichProblem statement: Path planning algorithms need to be developed and implemented in a suitable manner to give better understanding about the intelligent system and also stimulates technological supply to enormous demands in an intelligent vehicle industry. Approach: This study concerned with intelligent path planning using A* search algorithm. Results: This study introduced intelligent path planning with A* search algorithm, which … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 7,194 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Modified Conjugate Gradient Formula for Back Propagation Neural Network AlgorithmAbbas Y. Al Bayati, Najmaddin A. Sulaiman, Gulnar W. SadiqProblem statement: The Conjugate Gradient (CG) algorithm which usually used for solving nonlinear functions is presented and is combined with the modified Back Propagation (BP) algorithm yielding a new fast training multilayer algorithm. Approach: This study consisted of determination of new search directions by exploiting the information calculated by gradient descent as well as the previous search direction. The proposed … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Dec 2009 · 6,989 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPower Saving Mechanism in Clustered Ad-Hoc NetworksArwa Zabian, Ahmed IbrahimIn wireless Ad-Hoc networks, multihop transmission breaks the single hop path from a mobile node to another, into two or more hops, in a manner that the distances between transmitter and receiver are smaller than that in the direct transmission, which reduces the transmission power significantly. We have proposed the use of graph search algorithms to increase the power remaining … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 7,117 accessesView PDFCite
Research ArticleOpen accessIn the keywordsApplication of Harmony Search to Vehicle RoutingZong Woo Geem, Kang Seok Lee, Yongjin ParkA phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus … …American Journal of Applied Sciences, Vol. 2, Issue 12 · 31 Dec 2005 · 12,460 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCOV19-Dijkstra: A COVID-19 Propagation Model Based on Dijkstra’s AlgorithmArnaud Watusadisi Mavakala, Wilfried Yves Hamilton Adoni, Najib Ben Aoun et al.The presence of the coronavirus, known as COVID-19, has prompted several researchers to study the mode of spread and the different defense mechanisms of the virus. As a reminder, obtaining a vaccine, for which much research is being conducted around the world, is a long and expensive process and it is unlikely that the pandemic can be treated in time. … …Journal of Computer Science, Vol. 19, Issue 1 · 5 Jan 2023 · 6,606 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAn Empirical Criterion for Transitive ClosureMarius OrlowskiThe paper establishes a simple and computationally economical criterion for determining whether a given adjacency matrix represents a transitive closure or not. The criterion is based on a new iterative method for finding the transitive closure adjacency matrix. This method is equivalent to but computationally more efficient than the traditional Boolean sum of successive powers of the original adjacency matrix … …Journal of Computer Science, Vol. 18, Issue 12 · 23 Dec 2022 · 5,418 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Distributed Coverage and Target Tracking Algorithm for Wireless Sensor NetworksM. Senthamilselvi, N. DevarajanProblem statement: Due to communication, processing and energy constraints, tracking in sensor networks creates different challenges. Since existing algorithms utilized the information from all the sensors for tracking, it results in higher expenditure of energy and reduced lifetime for the network. Approach: We propose to develop a distributed coverage and target tracking algorithm for wireless sensor networks. Tracking issue is … …Journal of Computer Science, Vol. 8, Issue 3 · 6 Jan 2012 · 6,698 accessesView PDFCite