Shortest path
Differential evolution in shortest path problems
... In EA, there are two classic ways of dealing with the constrains of a problem: whether correct them, or penalize their value in the objective function [6]. After some trial and error, we choose the second one, through a ...
6
Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks
... the shortest route and they exhibit high computational complexity for real-time ...the shortest path problem relying on their parallel architecture to provide a fast solution (Araujo et ...
10
Identification of colorectal cancer related genes with mRMR and shortest path in protein-protein interaction network.
... the shortest path analysis of functional protein association ...the shortest path approach, we further found an additional 35 genes, of which some have been reported to be relevant to ...
12
Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators
... This paper proposed a coarse grained parallel genetic algorithm for solving the shortest path routing with the primary goal of achieving faster computation speed. The experiment is based on MPI cluster ...
4
Performance Analysis of Enhanced Interior Gateway Routing Protocol (EIGRP) Over Open Shortest Path First (OSPF) Protocol with Opnet
... In this section, the results obtained in chapter three are presented with their Performance Analysis of Enhance Interior Gateway Routing Protocol over Open Shortest Path First protocol. In all a model of ...
6
SHORTEST PATH ARC LENGTH NETWORK USING TRIANGULAR INTUITIONISTIC FUZZY NUMBER
... solving shortest path problem on a network with fuzzy arc ...that Path W 4 : U has W Y Z the shortest Euclidean distance for membership and ...the shortest path from source ...
6
Shortest Path Routing on Multi-Mesh of Trees
... For the purpose of shortest path routing on MOT, we address each node of the MOT by two-index binary labels as shown in Fig. 2 for a 7×7 mesh of trees. In this binary labelling, the root of a row-tree or ...
5
Optimal Fuel Saving in 4D Waypoint Networks
... Dijkstra’s shortest path algorithm that finds a fuel optimal trajectory from a given 4D waypoints network, this technique was used to compare different length (short and medium-haul) ...
10
4D Fuel Optimal Trajectory Generation from Waypoint Networks
... The analysis results show promising potential for reduction of consumed fuel and travel time in different flights via using the Dijkstra’s shortest path algorithm, across a range of common aircraft and ...
94
Robot Navigation in Dynamic Environment
... the shortest path and avoid the obstacles which are either moving or ...short path between goals and start point, and some clearance in between robot and obstacle to avoid hitting, and the Bezier ...
4
SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
... of shortest path problem on dynamic networks have been analyzed: reoptimization of shortest paths and time-dependent ...the shortest path ...
22
O PROBLEMA DA ÁRVORE DE CAMINHOS MAIS CURTOS ROBUSTA: FORMULAÇÕES E ALGORITMOS
... IPv6 Low Wireless Personal Area Networks (6LoWPAN) is the most promising tech- nology for implementing the so called Internet of Things. In order for this technology to become a reality, routing protocols need to be ...
60
Universidade Nova de Lisboa Faculdade de Ciências e Tecnologia Departamento de Informática Dissertação de Mestrado Mestrado em Engenharia Informática
... Finally, the third component is a traffic monitoring and distribution adjustment algorithm, which dynamically changes the flow traffic rates used by the previous component in order to reach optimality. The optimality ...
88
Unraveling spurious properties of interaction networks with tailored random networks.
... We close the discussion with two remarks, the first being of interest for experimentalists. Our findings also shed light on a network construction technique that relies on significance testing in order to decide upon ...
13
Forwarding Repeated Game for End-to-End QoS Support in Fiber-Wireless Access Networks
... For a FiWi access mesh network N , with R routers and G gateway routers, let us consider only the links that belong to the shortest path between each router and its nearest gateway route[r] ...
6
Network Effects in a Human Capital Based Economic Growth Model
... As described in section 2, agents live on the nodes of a network, which we call the influence network, since a ’newborn’ agent is influenced by his neighbor- hood on this network, in his decision concerning education. ...
13
MODEL FOR INTRUSION DETECTION SYSTEM
... the shortest path is optimized and provides the best and optimal path which will consider the problem of finding optimum path with least cost and least delay by using Genetic ...resultant ...
7
Passing the Brazilian OAB exam: data preparation and some experiments
... Analyzing the system’s output paints a more nuanced picture, however. In some cases, the system would find the correct justification article for the correct answer, but would pick as its putative answer another (incorrect) ...
6