Open shortest path first routing under random early detection
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21792
Abstract: In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we… read more here.
Keywords: open shortest; early detection; path first; shortest path ... See more keywords
Fault-Tolerant Approximate Shortest-Path Trees
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0396-z
Abstract: The resiliency of a network is its ability to remain effectively functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size,… read more here.
Keywords: path trees; fault tolerant; case; shortest path ... See more keywords
A novel deep neural networks based path prediction
Sign Up to like & getrecommendations! Published in 2020 at "Cluster Computing"
DOI: 10.1007/s10586-020-03056-8
Abstract: With the advancements in sensor applications, wireless sensor networks (WSNs) become significant area of research. WSNs compose various tiny sensor nodes to sense an environment, depends upon the given application. However, these nodes are battery… read more here.
Keywords: sensor; deep neural; novel deep; shortest path ... See more keywords
Shortest Path Evaluation in Wireless Network Using Fuzzy Logic
Sign Up to like & getrecommendations! Published in 2018 at "Wireless Personal Communications"
DOI: 10.1007/s11277-018-5645-1
Abstract: Evaluation of the shortest path in a wireless network is to ensure the fast and guaranteed delivery of the data over the established wireless network. Most of the wireless protocols are using a shortest path… read more here.
Keywords: wireless network; shortest path; evaluation; path ... See more keywords
Most vital vertices for the shortest s–t path problem: complexity and Branch-and-Cut algorithm
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-019-01527-5
Abstract: In this paper we study the most vital vertices for the shortest s–t path problem. This problem consists, given a digraph $$D=(V\cup \{s,t\},A)$$D=(V∪{s,t},A) and a threshold $$d\in \mathbb {N}$$d∈N, in finding the minimum number of… read more here.
Keywords: vital vertices; vertices shortest; path problem; shortest path ... See more keywords
An extension principle based solution approach for shortest path problem with fuzzy arc lengths
Sign Up to like & getrecommendations! Published in 2017 at "Operational Research"
DOI: 10.1007/s12351-016-0230-4
Abstract: AbstractA shortest path problem on a network in the presence of fuzzy arc lengths is focused in this paper. The aim is to introduce the shortest path connecting the first and last vertices of the… read more here.
Keywords: arc lengths; fuzzy; path problem; path ... See more keywords
Shortest Path Computation in a Network with Multiple Destinations
Sign Up to like & getrecommendations! Published in 2020 at "Arabian Journal for Science and Engineering"
DOI: 10.1007/s13369-020-04340-w
Abstract: The shortest path problem is the problem of finding a path with minimum total weight from a source node to each destination node in a network. The existing solution to this fundamental problem searches the… read more here.
Keywords: network; path computation; shortest path; path ... See more keywords
A Retroactive Approach for Dynamic Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2018 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0674-6
Abstract: AbstractDynamic shortest path algorithms modify the existing shortest path tree or graph, taking into account changes in the underlying graph configuration. In the premise of this paper, the dynamic Dijkstra algorithm is specifically considered which… read more here.
Keywords: retroactive approach; approach dynamic; path problem; path ... See more keywords
Normative pathways in the functional connectome
Sign Up to like & getrecommendations! Published in 2019 at "NeuroImage"
DOI: 10.1016/j.neuroimage.2018.09.028
Abstract: &NA; Functional connectivity is frequently derived from fMRI data to reduce a complex image of the brain to a graph, or “functional connectome”. Often shortest‐path algorithms are used to characterize and compare functional connectomes. Previous… read more here.
Keywords: connectivity; functional connectome; functional connectomes; shortest path ... See more keywords
Categorization of mergers and acquisitions using transaction network features
Sign Up to like & getrecommendations! Published in 2021 at "Research in International Business and Finance"
DOI: 10.1016/j.ribaf.2021.101421
Abstract: Abstract Mergers and acquisitions (M&A) have occurred among tens of thousands of companies. Categorization of M&A is important to both corporate strategy and academic research. Previous research largely uses case studies and econometric data analysis… read more here.
Keywords: transaction networks; mergers acquisitions; transaction; categorization ... See more keywords
From the divergence between two measures to the shortest path between two observables
Sign Up to like & getrecommendations! Published in 2017 at "Ergodic Theory and Dynamical Systems"
DOI: 10.1017/etds.2017.114
Abstract: We consider two independent and stationary measures over $\unicode[STIX]{x1D712}^{\mathbb{N}}$ , where $\unicode[STIX]{x1D712}$ is a finite or countable alphabet. For each pair of $n$ -strings in the product space we define $T_{n}^{(2)}$ as the length of… read more here.
Keywords: divergence two; path two; two measures; shortest path ... See more keywords