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

60 results for “A6 CPU”
Set a search alert
Research ArticleOpen accessIn the abstractAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,621 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Newton's Method with Diagonal Jacobian Approximation for Systems of Nonlinear EquationsM. Y. Waziri, W. J. Leong, M. A. Hassan, M. MonsiProblem statement: The major weaknesses of Newton method for nonlinear equations entail computation of Jacobian matrix and solving systems of n linear equations in each of the iterations. Approach: In some extent function derivatives are quit costly and Jacobian is computationally expensive which requires evaluation (storage) of n×n matrix in every iteration. Results: This storage requirement became unrealistic when n … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 8,541 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimization of Test Scheduling and Test Access for ITC-02 SOC Benchmark CircuitsP. Sakthivel, R. Delhi Babu, P. NarayanasamyProblem statement: This study presented the optimized test scheduling and test access for ITC-02 SOC benchmark circuits using genetic algorithm. In the scheduling procedure of SOC, scheduling problem was formulated as a sequence of two problems and solved. Approach: Test access mechanism width was partitioned into two and three partitions and the applications of test vectors and test vector assignments … …Journal of Computer Science, Vol. 5, Issue 4 · 30 Apr 2009 · 7,319 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Fast Distance-Based Algorithm to Detect OutliersMoh’d Belal Al-Zoubi, Nadim ObeidvA fast distance-based algorithm for outlier detection will be proposed. It was found that the proposed algorithm reduced the number of distance calculations compared to the nested-loop algorithm. Test results were performed on different well-known data sets. The results showed that the proposed algorithm gave a reasonable amount of CPU time saving. …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,734 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance Evaluation of a QoS-Aware Mechanism for Polling-Based High-Speed Network InterfacesSalman Al-Qahtani, Tarek Helmy, Khaled SalahThe explosive growth of the high-speed multimedia networks and the widespread use of web-based related applications place new demands on the network servers. The network end systems such as PC-Router, network server and host connected to high speed links must satisfy QoS requirements for multimedia traffics such as delay and loss ratio. Most works on operating systems support for high-speed … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,570 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimized WFST-Based ASR for Arabic: Balancing Memory, Speed, and AccuracyWael A. Sultan, Mourad S. Semary, Sherif M. AbdouWeighted Finite-State Transducers (WFSTs) have revolutionized Automatic Speech Recognition (ASR) by enabling significantly faster decoding speeds compared to traditional systems that build the search space progressively. However, applying WFSTs to morphology-rich languages such as Arabic presents challenges due to the large vocabulary, resulting in extensive networks that exceed the memory capacity of standard CPUs. This study introduces various strategies to … …Journal of Computer Science, Vol. 22, Issue 2 · 23 Feb 2026 · 1,446 accessesView PDFCite
Research ArticleOpen accessIn the abstractConceptual Modeling for Computer Organization and ArchitectureSabah Al-FedaghiUnderstanding computer system hardware, including how computers operate, is essential for undergraduate students in computer engineering and science. Literature shows students learning computer organization and assembly language often find fundamental concepts difficult to comprehend within the topic materials. Tools have been introduced to improve students’ comprehension of the interaction between computer architecture, assembly language and the operating system. One such … …Journal of Computer Science, Vol. 17, Issue 2 · 22 Feb 2021 · 8,920 accessesView PDFCite
Research ArticleOpen accessIn the abstractComposite Pseudo Associative Cache with Victim Cache for Mobile ProcessorsLakshmi Deepika Bobbala, Monobrata Debnath, Byeong Kil LeeProblem statement: Multi-core trends are becoming dominant, creating sophisticated and complicated cache structures. One of the easiest ways to design cache memory for increasing performance is to double the cache size. The big cache size is directly related to the area and power consumption. Especially in mobile processors, simple increase of the cache size may significantly affect its chip area … …Journal of Computer Science, Vol. 7, Issue 10 · 4 Aug 2011 · 7,090 accessesView PDFCite
Research ArticleOpen accessIn the abstractRedundancy Schemes for High Availability Computer ClustersChristian K. Bassek, Samuel Pierre, Alejandro QuinteroThe primary goal of computer clusters is to improve computing performances by taking advantage of the parallelism they intrinsically provide. Moreover, their use of redundant hardware components enables them to offer high availability services. In this paper, we present an analytical model for analyzing redundancy schemes and their impact on the cluster’s overall performance. Furthermore, several cluster redundancy techniques are … …Journal of Computer Science, Vol. 2, Issue 1 · 31 Jan 2006 · 7,236 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Iterative Algorithms with Accelerate Convergence for Solving Implicit Difference EquationsQing-Fu Liu, Wei-Jun Zhong, Mancho ManevThis study focuses on the solution of implicit difference equations, which are very difficult to compute in parallel for the diffusion equation. For improving the convergence rates and the properties of gradual-approach convergence of Segment-Classic-Implicit-Iterative (SCII) and Segment-Crank-Nicolson-Iterative (SCNI) algorithms realizing efficient iterative computation in parallel by segmenting grid domains, SCII and SCNI algorithms with accelerated convergence are studied and … …American Journal of Applied Sciences, Vol. 1, Issue 1 · 31 Mar 2004 · 6,801 accessesView PDFCite