Most existing approaches to identity federation are based on static relationships. This leads to problems with scalability and deployment in real-time environment such as mobile networks. This paper introduces an underlying network and trust model for dynamic federation. We present a modified Dijkstra algorithm to calculate the trust value and apply a distributed reputation calculated based on ...

All-Pairs Shortest Paths: Earlier, we saw that Dijkstra’s algorithm and the Bellman-Ford algorithm both solved the problem of computing shortest paths in graphs from a single source vertex. Suppose that we want instead to compute shortest paths between all pairs of vertices. We could do this applying either Dijkstra or Bellman-Ford using every vertex as a source, but today we will consider an a...

Given two algorithms that perform the same task, one may ask which is better. One simple answer is that the algorithm that delivers the “best” answer is the better algorithm. But what if both algorithms deliver results of similar quality? In this case, a common metric that is utilized to differentiate between the two algorithms is the time to find a solution. Measurements, however, must be perf...

Given two algorithms that perform the same task, one may ask which is better. One simple answer is that the algorithm that delivers the “best” answer is the better algorithm. But what if both algorithms deliver results of similar quality? In this case, a common metric that is utilized to differentiate between the two algorithms is the time to find a solution. Measurements, however, must be perf...

In this study, an approach for generating the shortest-distance passage plan a ship is proposed considering navigable area obtained based on automatic identification system data. The designated information from electronic navigational chart and by traffic density using Jenks natural breaks classification. shortest-path algorithms used in our experiment are Dijkstra, A*, improved A*. Then, Dougl...

We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are distances between points). For many graph models, the running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is shown to be O ( V ) as compared with O(V1ogV + E ) required by th...

We present a detailed description of a machine-assisted veriication of an algorithm for self-stabilizing mutual exclusion that is due to Dijkstra Dij74]. This veriication was constructed using PVS. We compare the mechanical veriication to the informal proof sketch on which it is based. This comparison yields several observations regarding the challenges of formalizing and mechanically verifying...

Corresponding Author: Nor Amalina Mohd Sabri Center for Advanced Computing Technology (C-ACT), Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, Malaysia Email: [email protected] Abstract: Finding a shortest path in a high rise building during critical incident or evacuation is facing two main issues which are evacuees find difficulties to fin...