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

31 articles for “local search method”
Set a search alert
Research ArticleOpen accessIn the abstractEnrolment and Matching of Fingerprints using Minutiae TreePraseetha V.M., S. VadivelAutomated fingerprint matching is considered as the most challenging phase of fingerprint recognition since it can be affected by a variety of factors such as noise, skin condition, rotation, distortions and displacements. When there is a large database, the search time to get a matching fingerprint will be relatively high. To reduce the searching time in the database, we have … …Journal of Computer Science, Vol. 15, Issue 3 · 15 Mar 2019 · 7,566 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Elite Pool-Based Big Bang-Big Crunch Metaheuristic for Data ClusteringIbrahim Al-Marashdeh, Ghaith M. Jaradat, Masri Ayob et al.This paper delves into the capacity of enhanced Big Bang-Big Crunch (EBB-BC) metaheuristic to handle data clustering problems. BB-BC is a product of an evolution theory of the universe in physics and astronomy. Two main phases of BB-BC are big bang and big crunch. The big bang phase involves a creation of a population of random initial solutions, while in … …Journal of Computer Science, Vol. 14, Issue 12 · 19 Jun 2018 · 7,879 accessesView PDFCite
Research ArticleOpen accessIn the abstractAdaptive 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 abstractIMAGE RETRIEVAL USING CERTAIN BLOCK BASED DIFFERENCE OF INVERSE PROBABILITY AND CERTAIN BLOCK BASED VARIATION OF LOCAL CORRELATION COEFFICIENTS INTEGRATED WITH WAVELET MOMENTSB. Thenkalvi, S. MurugavalliContent Based Image Retrieval (CBIR) is an evolving topic under image processing. Retrieval on medical images plays a vital role in saving mankind. Medical Content Based Image Retrieval (MCBIR) does not stop its work in displaying similar images; it also goes one step further for diagnosis to decide the method of therapy by comparing the query image and database image. … …Journal of Computer Science, Vol. 10, Issue 8 · 3 Apr 2014 · 6,979 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn integrated Framework Based on Texture Features, Cuckoo Search and Relevance Vector Machine for Medical Image Retrieval SystemYogapriya Jaganathan, Ila VennilaAs medical images are widely used in healthcare applications, Content Based Medical Image Retrieval (CBMIR) system is needed for physicians to convey effective decisions to patients and for medical research students to learn imaging characteristics for their extensive research based on visual features. However the performance of the retrieval is restricted due to high feature dimensionality of visual features. To … …American Journal of Applied Sciences, Vol. 10, Issue 11 · 24 Sep 2013 · 6,878 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Gaussian Process Regression Model for the Traveling Salesman ProblemWanatchapong Kongkaew, Juta PichitlamkenProblem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. … …Journal of Computer Science, Vol. 8, Issue 10 · 30 Aug 2012 · 7,367 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 abstractVariable Neighborhood Simplex Search Methods for Global Optimization ModelsPongchanun LuangpaiboonProblem statement: Many optimization problems of practical interest are encountered in various fields of chemical, engineering and management sciences. They are computationally intractable. Therefore, a practical algorithm for solving such problems is to employ approximation algorithms that can find nearly optimums within a reasonable amount of computational time. Approach: In this study the hybrid methods combining the Variable Neighborhood Search … …Journal of Computer Science, Vol. 8, Issue 4 · 15 Feb 2012 · 6,510 accessesView PDFCite
Research ArticleOpen accessIn the abstractIndoor Positioning System Using Artificial Neural NetworkHamid Mehmood, Nitin K. Tripathi, Taravudh TipdechoProblem statement: Location knowledge in indoor environment using Indoor Positioning Systems (IPS) has become very useful and popular in recent years. A number of Location Based Services (LBS) have been developed, which are based on IPS, these LBS include asset tracking, inventory management and security based applications. Many next-generation LBS applications such as social networking, local search, advertising and geo-tagging … …Journal of Computer Science, Vol. 6, Issue 10 · 30 Aug 2010 · 8,838 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the State Assignment Problem Using Stochastic Search Aided with Simulated AnnealingWalid M. AlyProblem statement: Solving the state assignment problem means finding the optimum assignment for each state within a sequential digital circuit. These optimum assignments will result in decreasing the hardware realization cost and increasing the reliability of the digital circuit. Unfortunately, the state assignment problem belongs to the class of nondeterministic polynomial time problems (NP complete) which requires heavy computations. Different … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 6,966 accessesView PDFCite