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

108 articles for “Search Algorithms”
Set a search alert
Research ArticleOpen accessPhrase in the titleAN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMSRose Al Qasem, Taisir EldosIn modern chip design, cell placement is a stage in which cells representing well-defined functions are assigned physical locations, in a way that optimizes the total area and routing length. Cell placement is an NP-complete problem and the exact solution is generally far from reach for a practically sized instance. Hence, diversified heuristic algorithms are used to solve this problem. … …Journal of Computer Science, Vol. 9, Issue 8 · 25 Jun 2013 · 7,371 accessesView PDFCite
Research ArticleOpen accessPhrase 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
CorrigendumOpen accessPhrase in the titleCorrigendum: An Efficient Cell Placement Using Gravitational Search AlgorithmsRose Al Qasem, Taisir EldosCorrection to: Journal of Computer Science http://doi.org/10.3844/jcssp.2013.943.948, published online 01 August 2013; updated 11 April 2018 The original version of this Article contained errors in the affiliation for Tasir Eldos. The correct affiliation for Mr. Tasir Eldos is as follows: Department of Computer Engineering, Jordan University of Science and Technology, Al Ramtha, Irbid Jordan These errors have now been corrected … …Journal of Computer Science, Vol. 14, Issue 3 · 12 Apr 2018 · 7,573 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAdaptive 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 keywordsLocal Beam Search Algorithm for Power Saving in Clustered Ad-Hoc NetworksA. Zabian, F. Al-KalaniAn ad-Hoc network is an infrastructures network consisting of mobile moving nodes. Every node in network performs as a router or a package forwarder. Energy consumption of network interfaces can be significant. There is a relationship between the transmission power and the distance traveled by a packet, increasing the transmission power increases the reachable area at the cost of high … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 6,539 accessesView PDFCite
Research ArticleOpen accessIn the keywordsPower Saving Mechanism in Clustered Ad-Hoc NetworksArwa Zabian, Ahmed IbrahimIn wireless Ad-Hoc networks, multihop transmission breaks the single hop path from a mobile node to another, into two or more hops, in a manner that the distances between transmitter and receiver are smaller than that in the direct transmission, which reduces the transmission power significantly. We have proposed the use of graph search algorithms to increase the power remaining … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 7,117 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAn Empirical Criterion for Transitive ClosureMarius OrlowskiThe paper establishes a simple and computationally economical criterion for determining whether a given adjacency matrix represents a transitive closure or not. The criterion is based on a new iterative method for finding the transitive closure adjacency matrix. This method is equivalent to but computationally more efficient than the traditional Boolean sum of successive powers of the original adjacency matrix … …Journal of Computer Science, Vol. 18, Issue 12 · 23 Dec 2022 · 5,418 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Machine Learning Framework for Strategic Gameplay Optimization in Scrabble Using Reinforcement LearningMohd Kaleem, Kanta Prasad Sharma, Tapsi Nagpal et al.This paper explores and compare various artificial intelligence-based techniques used for playing classic board game Scrabble. As the world is evolving around finding quick and efficient techniques for the solution of each problem using Machine learning, gaming industry is also a flourishing industry and has grown 9.8% compared to previous year and has generated a revenue of 26.14 billion dollars … …Journal of Computer Science, Vol. 22, Issue 9 · 22 Sep 2026 · 666 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnalysis Quantum Implementation of Double AES Cryptography for Secure QR Code GenerationJimmy Wijaya, RojaliData security faces unprecedented challenges due to the rapid advancement of quantum computing technologies, which threaten to compromise foundational classical cryptographic algorithms. This study investigates the quantum implementation of a Double Advanced Encryption Standard (Double AES) scheme for generating secure, tamper-resistant Quick Response (QR) codes. The research encompasses architectural design, quantum circuit construction, and empirical performance evaluation across encryption/decryption execution … …Journal of Computer Science, Vol. 22, Issue 9 · 20 Sep 2026 · 571 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Crow Search Optimization Based Feature Selection With Optimal DNN for Big Data ClassificationC. Mahesh, J. Ruby Elizabeth, S. Gnana Selvan et al.Big data analytics has become popular due to its applicability in various real-time applications. To attain better performance, big data can be analyzed using the machine learning and deep learning models at recent times, various domains have started to deal with big dataset which involves numerous sets of features. Repetitive and unwanted features, which reduces the classification performance can be … …Journal of Computer Science, Vol. 22, Issue 6 · 30 Jun 2026 · 1,244 accessesView PDFCite