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

6 results for “Minimum Spanning Tree”

Set a search alert
Research ArticleOpen accessPhrase in the titleEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,820 accessesView PDFCite
Research ArticleOpen accessIn the keywordsValidation of Global Financial Crisis on Bursa Malaysia Stocks Market Companies via Covariance StructureShamshuritawati Sharif, Suzilah Ismail, Zurni Omar, Low Huey ThengThe global financial crisis of 2007 to 2009 affects the economic development around the world. It started with US in 2007 and followed by Malaysia in 2008. The purpose of this study is to validate the impact before and beginning of the crisis on seventy seven Bursa Malaysia stocks market companies. Two data sets of 2007 and 2008 were used … …American Journal of Applied Sciences, Vol. 13, Issue 11 · 27 Oct 2016 · 7,576 accessesView PDFCite
Research ArticleOpen accessIn the keywordsNetwork Topological Property of English Dialects Similarity: A Robust Filter ApproachMaman Abdurachman Djauhari, Gan Siew LeeWe show that the common approach to use of Minimum Spanning Tree (MST) to filter the information contained in a complex system of English dialects similarity is not robust. Later on we propose a robust filter based on the forest of all possible MSTs. To illustrate the advantages of this filter, Morgan’s data on English dialects similarity is analyzed and … …American Journal of Applied Sciences, Vol. 10, Issue 7 · 17 Jun 2013 · 6,593 accessesView PDFCite
Research ArticleOpen accessIn the abstractPolymer Processing and Performance Testing Based on Kruskal Algorithm for Numerical AnalysisYan TangPolymer processing is an injection molding product widely used in communication, medical, and other fields. The processing and forming of polymers involve complex processes, including many parameter controls to ensure the quality of finished products. This study innovatively uses the Kruskal algorithm to conduct numerical analysis on the performance of polymer processing and molding to obtain a scientifically efficient parameter … …American Journal of Biochemistry and Biotechnology, Vol. 20, Issue 3 · 29 Jul 2024 · 4,273 accessesView PDFCite
Research ArticleOpen accessIn the abstractREDUCING CALL BLOCKING PROBABILITY IN HYBRID MULTICAST WAVELENGTH DIVISION MULTIPLEXING NETWORKS USING WEIGHTED ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMD. V. Pradeep Sankar, K. MuneeswaranIn the proposed work, the focus is on increasing the available wavelength in the all-optical networks, for which the Routing and Wavelength Assignment plays a vital role. In the earlier reported work, the wavelengths were assigned to the links which covers a set of destinations but not all the intended destinations. However this proposed work, attempts were made to create … …Journal of Computer Science, Vol. 10, Issue 2 · 13 Nov 2013 · 6,854 accessesView PDFCite
Research ArticleOpen accessIn the abstractConsistent and Proficient Algorithm for Data Gathering in Wireless Sensor NetworksP. Balamurugan, K. DuraiswamyProblem statement: A wireless sensor network is usually deployed in a harsh geographical area to gather data that can be delivered to the remotely located base station. Sensor nodes have irreplaceable energy source, limited computational capability and limited memory. It is a challenge to maximize the use of energy of these sensor nodes to extend the network lifetime. Approach: This … …Journal of Computer Science, Vol. 7, Issue 9 · 25 Jul 2011 · 6,737 accessesView PDFCite