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

83 results for “Computational Efficiency”
Set a search alert
Research ArticleOpen accessIn the abstractComparison 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 accessIn the abstractHardware Implementation of a Genetic Algorithm Based Canonical Singed Digit Multiplierless Fast Fourier Transform Processor for Multiband Orthogonal Frequency Division Multiplexing Ultra Wideband ApplicationsMahmud Benhamid, Masuri B. OthmanProblem statement: Ultra Wide Band (UWB) technology has attracted many researchers' attention due to its advantages and its great potential for future applications. The physical layer standard of Multi-band Orthogonal Frequency Division Multiplexing (MB-OFDM) UWB system is defined by ECMA International. In this standard, the data sampling rate from the analog-to-digital converter to the physical layer is up to 528 … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,515 accessesView PDFCite
Research ArticleOpen accessIn the abstractSpatial Color Indexing: An Efficient and Robust Technique for Content-Based Image RetrievalRachid Alaoui, Said Ouatik El Alaoui, Mohammed MeknassiProblem statement: Color Histogram is admitted as a useful representation of features because it is a statistical result and possesses the merits of simplicity, robustness and efficiency. However, the main problem with color histogram indexing is that it doesn't take into account the spatial information. Previous researches have proved that the effectiveness of image retrieval increases when spatial feature of … …Journal of Computer Science, Vol. 5, Issue 2 · 28 Feb 2009 · 7,418 accessesView PDFCite
Research ArticleOpen accessIn the abstractNew Efficient Strategy to Accelerate k-Means Clustering AlgorithmMoh’d Belal Al- Zoubi, Amjad Hudaib, Ammar Huneiti, Bassam HammoOne of the most popular clustering techniques is the k-means clustering algorithm. However, the utilization of the k-means is severely limited by its high computational complexity. In this study, we propose a new strategy to accelerate the k-means clustering algorithm through the Partial Distance (PD) logic. The proposed strategy avoids many unnecessary distance calculations by applying efficient PD strategy. Experiments … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 7,437 accessesView PDFCite
Research ArticleOpen accessIn the abstractApproximate Analytical Solutions For Time-Dependent Emden-Fowler-Type Equations By Variational Iteration MethodKhaled BatihaThe main objective of the current study was to solve the time-dependent Emden-Fowler-type equation with singular behavior. The technique used here was called the variational iteration method (VIM). The advantage of this work is twofold. Firstly, the VIM reduces the computational work. Secondly, in comparison with existing techniques, the VIM is an improvement with regard to its accuracy and rapid … …American Journal of Applied Sciences, Vol. 4, Issue 7 · 31 Jul 2007 · 6,591 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn 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 accessIn the abstractReliability Evaluation of Distributed Computer Systems Subject to Imperfect Coverage and Dependent Common-Cause FailuresLiudong Xing, Akhilesh ShresthaImperfect coverage (IPC) occurs when a malicious component failure causes extensive damage due to inadequate fault detection, fault location or fault recovery. Common-cause failures (CCF) are multiple dependent component failures within a system due to a shared root cause. Both imperfect coverage and common-cause failures can exist in distributed computer systems and can contribute significantly to the overall system unreliability. … …Journal of Computer Science, Vol. 2, Issue 6 · 28 Sep 2006 · 6,838 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficient Maintenance Scheduler for Near Optimum Utilization of Oil TanksFawaz S. Al-Anzi, Khaled Al-ZamelDue to the entry of Kuwait into WTO and the expected liberalization of petroleum management, the oil market is to become more competitive. However, the space limitation and public increasing awareness of environmental protection issues and stricter regulation passed by Environmental Public Authority (EPA) in Kuwait make the need for full utilization of oil tanks a prime requirement of a … …American Journal of Environmental Sciences, Vol. 1, Issue 4 · 31 Dec 2005 · 6,515 accessesView PDFCite
Review ArticleOpen accessAll words, across the recordA Survey of Quadratization Methods Used in QUBO Formulations and their Usage in Quantum and Digital AnnealingGeethika Prabhath, Anuradha Mahasinghe, Nalin Ranasinghe, Kasun De ZoysaQuantum annealing is a metaheuristic method aimed at finding the global minimum of a pseudo-Boolean quadratic function. To solve a problem by a quantum annealer, it must be restated as a QUBO (quadratic unconstrained binary optimization) problem, the standard format acceptable to an annealer. However, there are many natural problems that turn out be of cubic or higher order, yet … …Journal of Computer Science, Vol. 22, Issue 1 · 16 Feb 2026 · 2,554 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordImprovement of the Runner Design of Francis Turbine using Computational Fluid DynamicsSuthep Kaewnai, Somchai WongwisesProblem statement: The objective of this study is to improve runner design of the Francis turbine and analyze its performance with the Computational Fluid Dynamics (CFD) technique. Approach: A runner design process uses a direct method with the following design conditions: flow rate of 3.12m3/sec head of 46.4 m and speed of 750 rpm or dimensionless specific speed of 0.472. … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 25 Jan 2012 · 8,920 accessesView PDFCite