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

39 results for “shortest path algorithm”
Set a search alert
Research ArticleOpen accessIn the abstractA Free Educational Java Framework for Graph AlgorithmsGianluca Costa, Claudia D’Ambrosio, Silvano MartelloProblem statement: In the teaching of graph theory algorithms it is important that students can experiment them on numerical instances in order to fully understand their logical meaning and to learn how they can be implemented. Approach: We developed an open source Java framework to help students in their approach to the study of graph algorithms. The framework was implemented … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,397 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 accessesView PDFCite
Research ArticleOpen accessIn the abstractDNA Code Word Design for DNA Computing with Real-Time Polymerase Chain ReactionMuhammad Faiz Mohamed Saaid, Zuwairie Ibrahim, Mohamad Shukri Zainal Abidin et al.Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during a computation. We have … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,502 accessesView PDFCite
Research ArticleOpen accessIn the abstractRandom Graph Generation Based p-Method and Box Method for the Evaluation of Power-Aware Routing Protocols of Ad hoc NetworksSaleh H. Al-SharaehThe objective of this paper is to investigate the best solution such that on which decision should be made to forward a wireless packet. The decision should be made in such a way to keep the node alive by choosing an alternate path, through those nodes that have more power reserve. Minimizing the consumption of the reserve power will results … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 6,762 accessesView PDFCite
Research ArticleOpen accessIn the abstractEmbedding Malaysian House Red Ant Behavior into an Ant Colony SystemZ. A. Othman, H. M. Rais, A. R. HamdanProblem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. However, it still has a room on an improvement. This research aims to improve the algorithm by embedding individual Malaysian … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,961 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeneralized Shortest Path Problem in Uncertain Environment Based on PSOHayder A. Mukhef, Ekhlas M. Farhan, Mohammed R. JassimGeneralized network problems describe situations in which flow can be generated or consumed through arcs. This research considers generalized shortest path problem in stochastic environment in which the changing rate of flow is random. To satisfy the demands of decision makers, three types of models have been formulated to solve the generalized shortest path problem under different decision criteria. The … …Journal of Computer Science, Vol. 4, Issue 4 · 30 Apr 2008 · 6,749 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnergy Aware Optimal Routing for Wireless Sensor NetworksS. Chandramathi, U. Anand, T. Ganesh et al.Wireless Sensor Network (WSN) is a collection of autonomous devices with computational, sensing, and wireless communication capabilities. The sensor nodes are low cost, multi-functional devices that are densely deployed either inside the phenomenon or very close to it and are often powered by independent power sources. The lifetime of such sensor nodes show a strong dependence on lifetime of the … …Journal of Computer Science, Vol. 3, Issue 11 · 30 Nov 2007 · 6,645 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordBin Bay: An Optimized Smart Waste Disposal System for a Sustainable Urban Life using LSTM and Fog ComputingShiny Duela, Dioline Sara, PrabavathiTo create green and smart cities, a smart and planned WasteManagement System (WMS) is a vital requirement. With the increase in the urbanpopulation and service delivery difficulties, smart cities are integratingtechnologies such as smart waste bins and Radio Frequency Identification (RFID)tags into their day-to-day operations to make solid waste management andcontrol more effective. Fog computing in waste management is becoming … …Journal of Computer Science, Vol. 18, Issue 11 · 16 Nov 2022 · 6,661 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordMultipath Adaptive Packet Dispersion for Voice ApplicationsJ. Faritha Banu, V. RamachandranProblem statement: The quality of Voice over IP applications is decided by the main factors like network capacity and technologies such as codec type, Packet Loss Concealment (PLC) and Forward Error Correction (FEC). Approach: In MPLS networks multiple Label Switched Paths (LSP) are established between MPLS ingress and egress nodes to enhance the network performance and QoS for subscribers. To … …Journal of Computer Science, Vol. 8, Issue 4 · 27 Jan 2012 · 7,716 accessesView PDFCite