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

49 articles for “exact algorithm”
Set a search alert
Also matching:2 special issues
Research ArticleOpen accessPhrase in the titleComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber ProblemsChansiri Singhtaun, Peerayuth CharnsethikulProblem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distance between the facilities … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,524 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleAn Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing TimeChanin Srisuwannapa, Peerayuth CharnsethikulWe address a variant of the unbounded knapsack problem (UKP) into which the processing time of each item is also put and considered, referred as MMPTUKP. The MMPTUKP is a decision problem of allocating amount of n items, such that the maximum processing time of the selected items is minimized and the total profit is gained as at least as … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,595 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExact Permutation Algorithm for Paired Observations: A General and Efficient VersionDavid T. MorseFor the better part of a century, methods have been illustrated for the enumeration of all possible permutations of cases from which an exact characterization of the likelihood of obtaining results as or more extreme as that observed may be determined without having to rely on parametric assumptions or schemes that may be only asymptotically correct. The challenge is the … …Journal of Mathematics and Statistics, Vol. 10, Issue 4 · 5 Jan 2015 · 6,672 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleThe Exact Root Algorithm for Computing the Real Roots of an Nth Degree PolynomialE. A. Adebile, V. I. IdokoProblem statement: The need to find an efficient and reliable algorithm for computing the exact real roots of the steady-state polynomial encountered in the investigation of temperature profiles in biological tissues during Microwave heating and other similar cases as found in the literature gave rise to this study. Approach: The algorithm (simply called ERA-Exact Root Algorithm) adopted polynomial deflation technique … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 7,555 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExact Permutation Algorithm for Paired Observations: The Challenge of R. A. FisherJ. I. Odiase, S. M. OgbonmwanThe major handicap of permutation test is the logical and computational requirement necessary to develop and implement the exact permutation scheme. This study provides an algorithm that systematically enumerates all the distinct permutations of the paired observations in an experiment without the possibility of repeating any of the permutations. The permutation algorithm presented completely breaks down the permutation problem for … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,866 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search AlgorithmsAbdulwahab Ali AlmazroiProblem statement: String matching algorithm had been an essential means for searching biological sequence database. With the constant expansion in scientific data such as DNA and Protein; the development of enhanced algorithms have even become more critical as the major concern had always been how to raise the performances of these search algorithms to meet challenges of scientific information. Approach: … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,398 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Fast Hybrid Algorithm for the Exact String Matching ProblemAbdulwahab Ali Al-mazroi, Nur’Aini Abdul RashidProblem statement: Due to huge amount and complicated nature of data being generated recently, the usage of one algorithm for string searching was not sufficient to ensure faster search and matching of patterns. So there is the urgent need to integrate two or more algorithms to form a hybrid algorithm (called BRSS) to ensure speedy results. Approach: This study proposes … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 1 · 31 Jan 2011 · 8,240 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOptimized Set of RST Moment InvariantsKhalid M. HosnyMoment invariants are widely used in image processing, pattern recognition and computer vision. Several methods and algorithms have been proposed for fast and efficient calculation of moment's invariants where numerical approximation errors are involved in most of these methods. In this paper, an optimized set of moment invariants with respect to rotation, scaling and translation is presented. An accurate method … …American Journal of Applied Sciences, Vol. 5, Issue 6 · 30 Jun 2008 · 7,069 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMeta Heuristic Algorithms for Vehicle Routing Problem with Stochastic DemandsGeetha Shanmugam, Poonthalir Ganesan, Dr. P.T. VanathiProblem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP) which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 8,021 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA New Separable Logarithmic Algorithm for Non-Linear OptimizationAbbas Y. Al-Bayati, Hawraz N. JabbarProblem statement: The idea of this study stemmed from the fact that most of the currently used optimization algorithms use a local quadratic representation of the objective function. It also arisen from the fact that the objective function may not be represented adequately by quadratic functions and the global minimizer may be obtained for objective functions. So, in this study, … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 6,872 accessesView PDFCite