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

51 results for “exact algorithm”
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 abstractA Preamble-Based Frequency Offset Compensation Scheme in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing SystemsElnaz Ershadi, Hamidreza BakhshiProblem statement: Combining the properties of Multiple Input Multiple Output (MIMO) systems with those of Orthogonal Frequency Division Multiplexing (OFDM), MIMO-OFDM was considered to be a promising technique in the future of wireless communications. However, its sensitivity to frequency offsets which results in Inter-Carrier Interferences (ICIs) makes it necessary to use an exact frequency offset estimation method for data recovery … …Journal of Computer Science, Vol. 6, Issue 4 · 30 Apr 2010 · 7,570 accessesView PDFCite
Research ArticleOpen accessIn the abstractQuadratic Convergence Ratio of Constrained Optimal Control ProblemsO. OlotuProblem statement: Earlier Researchers developed algorithms for solving quadratic control problems, but did not address the quadratic convergence ratio profile. Approach: Hence, the objective of this work is using our developed scheme, Discretized Continuous Algorithm (DCA), to examine both convergence profile and quadratic ratio profile demonstrating the effectiveness and efficiency of the scheme. Methodologically, we obtained generalized unconstrained formulation of … …Journal of Mathematics and Statistics, Vol. 6, Issue 1 · 31 Mar 2010 · 7,372 accessesView PDFCite
Research ArticleOpen accessIn the abstractDifferential Diagnosis Knowledge Building by Using CUC-C4.5 FrameworkKusrini, Sri Hartati, Retantyo Wardoyo, Agus HarjokoProblem statement: The Case Based Reasoning (CBR) method can be implemented in differential diagnosis analysis. C4.5 algorithm has been commonly used to help the method's knowledge building process. This process is completed by constructing decision tree from previously handled cases data. The C4.5 algorithm itself can be used with an assumption that all the cases has an exact and equal … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 8,411 accessesView PDFCite
Research ArticleOpen accessIn the abstractFacial Features for Template Matching Based Face RecognitionChai Tong Yuen, M. Rizon, Woo San San, Tan Ching SeongProblem statement: Template matching had been a conventional method for object detection especially facial features detection at the early stage of face recognition research. The appearance of moustache and beard had affected the performance of features detection and face recognition system since ages ago. Approach: The proposed algorithm aimed to reduce the effect of beard and moustache for facial features … …American Journal of Applied Sciences, Vol. 6, Issue 11 · 30 Nov 2009 · 9,375 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeneric Algorithm with Varying Block Sizes to Improve the Capacity of a Wireless Communications NetworksMahmoud AbdellaouiProblem statement: Channel capacity can be an essential parameter for wireless communication to improve the link quality. Until now, the channel capacity has been evaluated by utilizing Shannon capacity theory, but it presented many limitations and restrictions. The objectives of this study were to: (i) Expose, quantify, present and to give a clear and concise exposition of the mathematical principles … …Journal of Computer Science, Vol. 5, Issue 4 · 30 Apr 2009 · 6,899 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Algorithm for Mining Maximal Frequent Item SetsA. M.J.M.Z. Rahman, P. BalasubramanieProblem Statement: In today's life, the mining of frequent patterns is a basic problem in data mining applications. The algorithms which are used to generate these frequent patterns must perform efficiently. The objective was to propose an effective algorithm which generates frequent patterns in less time. Approach: We proposed an algorithm which was based on hashing technique and combines a … …Journal of Computer Science, Vol. 4, Issue 8 · 31 Aug 2008 · 6,567 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Algorithms for String Matching Problem on Single and Two Dimensional Reconfigurable Pipelined Bus SystemsS. Viswanadha Raju, A. Vinaya BabuWe considered string matching on LARPBS and 2D LARPBS. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using LARPBS. We investigated exact string matching and approximate string matching problems. For these two sub problems, we obtained O (n) … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,530 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnalysis of Hierarchical Diff-EDF Schedulability over Heterogeneous Real-Time Packet NetworksMoutaz Saleh, Zulaiha Ali OthmanPacket networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,530 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Fast Approximate String Searching AlgorithmMahmoud Mhashi, Adnan Rawashdeh, Awni HammouriIn both approximate and exact string searching algorithms, the shift distance at the skipping step plays a major role in the performance of string matching algorithms. A new algorithm called the Modified Character-Weight Algorithm (MWA) has been developed to test the effect of the shift distance on the performance of approximate string matching. An experiment was performed comparing the performance … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,907 accessesView PDFCite