6 results for “Range Assignment”

Set a search alert

Research ArticleOpen accessPhrase in the titleEnergy-Efficient Ant Colony-Based k-Hop Clustering and Transmission Range Assignment Protocol for Connectivity Construction in Dense Wireless Sensor NetworksGokou Hervé Fabrice Diédié, Boko Aka, Michel BabriConnectivity construction is the main phase of a communication-oriented topology control process. It consists of improving the current network physical topology while preserving important properties such as connectivity and symmetry. In this paper, we address the problem of combining two of the techniques commonly used for this purpose in networks composed of a large number of energy constrained wireless sensor-nodes … …Journal of Computer Science, Vol. 14, Issue 3 · 19 Mar 2018 · 7,792 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Novel Approach for Discovering the Patterns by using PDBD Model in Big DataKamatchi Sundravadivelu, Muthuraman ThangarajBig data is a term that refers to information collected from a wide range of sources, including transaction processing systems, sensors, digital photographs, internet click stream logs, movies, and social media. The goal of text mining is to reveal new patterns and relationships that could lead to the discovery of previously unknown sources. It provides ample scope for interpretation of … …Journal of Computer Science, Vol. 18, Issue 5 · 21 May 2022 · 6,045 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Successive Admissible Cell Method for Solving Large Scale Linear Assignment Problem with Dense Cost MatrixWarut Boonphakdee, Peerayuth CharnsethikulNormally, the Linear Assignment Problem (LAP) has been solved by successful algorithms such as Lapjv and Munkres programmed as MATLAB codes. This study presented an improved algorithm for solving large scale LAP. A preprocessing (PP) algorithm was proposed to apply for constructing the kth transferred reduced cost matrix then this matrix was solved by Lapjvalgorithm. Performances of PP-Lapjvalgorithm were faster … …Journal of Computer Science, Vol. 12, Issue 8 · 16 Nov 2016 · 6,948 accessesView PDF Cite

Research ArticleOpen accessIn the abstractOPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITYRanjana Ponraj, George AmalanathanThe Multiple Travelling Salesman Problems (MTSP) can be used in a wide range of discrete optimization problems. As the solution to this problem has wide applicability in many practical fields, this NP Hard problem highly raises the need for an efficient solution. The problem is determining a set of routes for the salesmen that jointly visit a set of given … …Journal of Computer Science, Vol. 10, Issue 4 · 23 Dec 2013 · 6,795 accessesView PDF Cite

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 PDF Cite

Research ArticleOpen accessIn the abstractRobustness Results for Hierarchical Diff-EDF Scheduling upon 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 5 · 31 May 2007 · 6,601 accessesView PDF Cite