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

48 results for “Shortest Path”
Set a search alert
Research ArticleOpen accessEvery word in the titleSHAPE RETRIEVAL THROUGH MAHALANOBIS DISTANCE WITH SHORTEST AUGMENTING PATH ALGORITHMS. Muruganathan, N. Devarajan, D. Chitra, T. ManigandanShape matching and object recognition plays an vital role in the computer vision. The shape matching is difficult in case of the real world images like mpeg database images since the real world images has the internal and external contours. The Mahalanobis distance based shape context approach is proposed to measure similarity between shapes and exploit it for shape retrieval. … …Journal of Computer Science, Vol. 10, Issue 4 · 3 Dec 2013 · 6,856 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Novel Time-Based Switch Migration Method (TSSM) for Load Balancing in Distributed Software-Defined NetworkingThangaraj E, Dinesh K, Prabhakaran Paulraj et al.Switch migration is predominantly used for workload balancing in distributed Software Defined Network (SDN) controllers. The Time-Sharing Switch Migration (TSSM) technique allowed the switch's responsibility to be divided based on the time duration condition of overload, which resulted in fewer overload events, fewer ping-pong controller issues, and more efficient controllers. However, it has higher controller resource utilization during TSSM working … …Journal of Computer Science, Vol. 22, Issue 3 · 6 Mar 2026 · 1,586 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Utilisation of Dijkstra's Algorithm to Assist Evacuation Route in Higher and Close BuildingNor Amalina Mohd Sabri, Abd Samad Hasan Basari, Burairah Husin, Khyrina Airin Fariza Abu SamahFinding a shortest path in a high rise building during critical incident or evacuation is facing two main issues which are evacuees find difficulties to find the best routes and their behavior makes the process more difficult. These problems are important since it is related to the human's life. By providing the shortest path and control the evacuee behavior, these … …Journal of Computer Science, Vol. 11, Issue 2 · 28 Jan 2015 · 8,172 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA PARTICLE SWARM OPTIMIZATION APPROACH FOR LOW POWER VERY LARGE SCALE INTEGRATION ROUTINGG. Nallathambi, S. RajaramThis study deals with the particle swarm optimization approach for optimal power dissipation in VLSI interconnect driven routing technique. Interconnect power dissipation is a major challenging research problem in Deep Submicron (DSM) regime that affects the overall circuit performance. The Buffer Insertion Buffer Sizing and Wire Sizing (BISWS) is considered for minimizing the power dissipation in VLSI circuits using interconnect … …Journal of Mathematics and Statistics, Vol. 10, Issue 1 · 1 Feb 2014 · 6,741 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOPTIMIZING 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 PDFCite
Research ArticleOpen accessIn the keywordsAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,049 accessesView PDFCite
Research ArticleOpen accessIn the keywordsReal Time Multigraphs for Communication Networks: An Intuitionistic Fuzzy Mathematical ModelSiddhartha Sankar Biswas, Bashir Alam, Mohammad Najmud DojaMany problems of computer science, communication network, transportation systems, can be modeled into multigraphs (or graphs) and then can be solved. Nowadays, the networks are expanding very fast in huge volumes in terms of their nodes and the connecting links. For a given alive network, in many situations, its complete topology may not be always available to the communication systems … …Journal of Computer Science, Vol. 9, Issue 7 · 17 Jun 2013 · 7,068 accessesView PDFCite
Research ArticleOpen accessIn the keywordsImpact of Four Wave Mixing (FWM) in Routing and Wavelength AssignmentTan Saw Chin, F.M. Abbou, Ewe Hong TatThe impact of Four-Wave-Mixing (FWM) is investigated using the proposed Assign Shortest Path First (ASPF) algorithm for wavelength assignment in Routing and Wavelength Assignment (RWA). Results show that ASPF algorithm indulges more FWM crosstalk in high optical channels for all input light power and low input power able to reduce he effect of FWM. The blocking probability due to FWM … …American Journal of Applied Sciences, Vol. 5, Issue 8 · 31 Aug 2008 · 6,753 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEmpirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision DiagramsA. Assi, P. W.C. Prasad, B. Mills, A. ElchouemiInformation about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the circuit represented by these Boolean functions. This study presents expressions produced from an empirical analysis of a representative collection of Boolean functions. The Average Path Length (APL) and the Shortest Path Length … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,814 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA 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 PDFCite