Results 211 to 220 of about 2,266 (237)
Some of the next articles are maybe not open access.
2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA), 2018
k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios ...
Yang Wang +6 more
openaire +1 more source
k-shortest path problem (KSP) is a more general form of the classical shortest path problem in graph. Its task is no longer to find the shortest path between two vertices, but to find the shortest k paths. So far, the reported KSP-algorithms only considers finding shortest k paths with regard to a single criterion, while far more application scenarios ...
Yang Wang +6 more
openaire +1 more source
Photonic Network Communications, 2006
In communication networks, traffic carried over long paths suffers from a higher call blocking probability (CBP) than those carried over short paths. This is a well-known fairness problem. Such a problem becomes more serious in wavelength-routed optical networks (WRONs) due to the wavelength continuity constraint.
Junjie Li, Hanyi Zhang
openaire +1 more source
In communication networks, traffic carried over long paths suffers from a higher call blocking probability (CBP) than those carried over short paths. This is a well-known fairness problem. Such a problem becomes more serious in wavelength-routed optical networks (WRONs) due to the wavelength continuity constraint.
Junjie Li, Hanyi Zhang
openaire +1 more source
SPIE Proceedings, 2006
Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW).
Xinyou Cui +4 more
openaire +1 more source
Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW).
Xinyou Cui +4 more
openaire +1 more source
International Journal of Operational Research, 2018
The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity.
openaire +1 more source
The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity.
openaire +1 more source
TENCON 2014 - 2014 IEEE Region 10 Conference, 2014
For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then,
openaire +1 more source
For finding all-pairs shortest paths in a digraph of n nodes, the well-known Floyd-Warshall method yields a particular best path between each pair of nodes efficiently in running time O(n3) when there is no negative-cost cycle (and all ties are ignored). Such a digraph may be a model of a real-world transportation, communication, or road network; then,
openaire +1 more source
2023 IEEE Latin American Conference on Computational Intelligence (LA-CCI), 2023
Ivan I. Ríos-Villalba +3 more
openaire +1 more source
Ivan I. Ríos-Villalba +3 more
openaire +1 more source
Quantum indistinguishability by path identity and with undetected photons
Reviews of Modern Physics, 2022Armin Hochrainer +2 more
exaly
Targeting Notch in oncology: the path forward
Nature Reviews Drug Discovery, 2020Samarpan Majumder +2 more
exaly
Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths
IEEE Transactions on Automatic Control, 2006Z. Jia, P. Varaiya
openaire +1 more source
The silent path to thousands of merozoites: the Plasmodium liver stage
Nature Reviews Microbiology, 2006Maria M Mota, Miguel Prudêncio
exaly