Using Moore Dijkstra Algorithm with Multi-Agent System to Find Shortest Path over Network
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2015, Vol 6, Issue 6
Abstract
finding the shortest path over network is very difficult and it is the target for much research, after many researches get the result in many of algorithm and many a mount based on the performance for these algorithm .Shortest paths problems are familiar problems in computer science and mathematics. In these problems, edge weights may represent distances, costs, or any other real-valued quantity that can be added along a path, and that one may wish to minimize. Thus, edge weights are real numbers and the specific operations used are addition to compute the weight of a path and minimum to select the best path weight. In this paper we use the Dijkstra's algorithm with new technique to find the shortest path over network to reduce the time we need to find the best path, in this paper we use node for network with the same value which can be use it to find the shortest path but this depend on the number of transition for every node when the node have high number then the node have the high priority to choose it by using this method we descries the time to find the short path .to make this algorithm more distinguish apply multi-agent system ( Automata with multiplicities ) to find the short path.
Authors and Affiliations
Basem Alrifai
Keywords
Related Articles
- EP ID EP137748
- DOI 10.14569/IJACSA.2015.060626
- Views 140
- Downloads 0
Fast and Efficient In-Memory Big Data Processing
With the passage of time, the data is growing exponentially and the mostly endured areas are social media networks, media hosting applications, and servers. They have thousands of Tera-bytes of data and the efficient sys...
WhatsApp as an Educational Support Tool in a Saudi University
WhatsApp is a widely used social media app, growing in popularity across the Middle East, and the most popular in Saudi Arabia. In this paper, we investigate the usage of WhatsApp as an educational support tool in a Saud...
A New Design of in-Memory File System based on File Virtual Address Framework
Rapid growth in technology is increasing day by day that demands computer systems to work better, should be reliable and have faster performance with fair cost and best functionalities. In the modern era of technology, m...
EDAC: A Novel Energy-Aware Clustering Algorithm for Wireless Sensor Networks
Clustering is a useful technique for reducing energy consumption in wireless sensor networks (WSN). To achieve a better network lifetime performance, different clustering algorithms use various parameters for cluster hea...
A Grammatical Inference Sequential Mining Algorithm for Protein Fold Recognition
Protein fold recognition plays an important role in computational protein analysis since it can determine protein function whose structure is unknown. In this paper, a Classified Sequential Pattern mining technique for P...