Self-organizing wireless metropolitan area networks connecting portable GSM/UMTS base stations are a valuable asset to rescue forces in disaster recovery. These networks can be formed by routers employing multiple commercially available IEEE 802.16-2004 interfaces. In this paper, we present and evaluate an algorithm for self-organized topology construction and channel allocation. The algorithm ...

Optimal alignments are the basis of conformance checking. For long, researchers have been devoted to efficiency issue computing optimal alignments. This paper focuses on optimality issue. Specifically, we aim find with maximum synchronous moves and minimum deviations. introduces a coordinate-plane search space, which allows enumerating all possible The translated into lowest-cost paths, such th...

The determination of the shortest route can be done using various methods, one which is Dijkstra algorithm. This algorithm often used in routing problems with minimum weight computer networks, communication networks and transportation networks. There are several applications Djikstra algorithm, namely solving problem path neutrosophy, mapping tourism potential, developing geographic information...

This paper presents a new method for finding shortest node-disjoint paths in optical-switched networks with no wavelength conversion. The proposed method is based on a modified version of Dijkstra algorithm that works on an expanded so-called dual-network topology with n×nnodes and 2×m×n links, where n is the number of nodes and m is the number of links in the original network. Despite the larg...

We present a nearly optimal (O(ν min(ν, n)n log n) time and O(n) space) algorithm that constructs a shortest path map with n isothetic roads of speed ν under the L1 metric. The algorithm uses the continuous Dijkstra method and its efficiency is based on a new geometric insight; the minimum in-degree of any nearest neighbor graph for points with roads of speed ν is Θ(ν min(ν, n)), which is first...

The shortest path problem is one of the most fundamental problems in network optimization. This paper is concerned with shortest path problems in non-deterministic environment, in which the lengths of some arcs have stochastic characteristics and meanwhile some have uncertain characteristics. In order to investigate paths in these networks, this paper introduces the chance distribution of minim...

A family of approaches for the implementation of Dynamic Programming optimization can be improved for real time applications if the queuing stage is improved. The computational cost of maintaining a priority queue (PQ) for the standard Dijkstra’s algorithm has a theoretical lower bound that is function of the queue population. However a perfect PQ is not a necessary condition for implementing t...