Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In paper, we use programming find path due their generality, reduction of complexity facilitation numerical computation, simplicity incorporating constraints, onformity stochastic natur...

The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficie...

Çin, çok tarafl? ula?t?rma politikalar? ve 21. yy. ?pek Yolunu olu?turma hedefi kapsam?nda 2013 y?l?nda tarihi bir ad?m atm??t?r. “Ku?ak Yol” slogan? ile Pekin’ den Londra’ ya ula?an yeni ticaret yolunun projesini aç?klam?? güzergâh ülkelerine i? birli?i ça?r?s?na bulunmu?tur. Modern Yolu olarak da adland?r?lan bu proje; kara, deniz demiryolu ta??mac?l???n?n kullan?larak Çin güzergâhtaki 65’den...

Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. In its pioneering paper, Dijkstra proposed three algorithms for token ring systems. Such systems are very useful to solve distributed mutual exclusion. Using the token deenition introduced by Dijkstra, i.e. t...

We present an algorithm for computing k-link rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log n) and space O(kn), where n is the number of vertices of the obstacles. Previous algorithms for the problem had worst...

We propose a methodology for the specification and verification of distributed algorithms using Gurevich’s concept of Abstract State Machines. The methodology relies on a distinction between a higherlevel specification and a lower-level specification of an algorithm. The algorithm is characterized by an informal problem description. A justification assures the appropriateness of the higher-leve...