Results 91 to 100 of about 243,105 (216)
Preventive start‐time optimisation of open shortest path first link weights for hose model
IET Networks, 2014 Optimising link weights in an open shortest path first network is a challenging traffic engineering problem to reduce network congestion. Most of the previous studies have focused on the application of start‐time optimisation (SO) and run‐time optimisation on both pipe and hose models of link weight optimisation.
Ravindra Sandaruwan Ranaweera +2 more
openaire +2 more sources
Path planning in three-dimensional space based on butterfly optimization algorithm
Scientific ReportsPath planning is one of the most critical issues in many related fields including UAVs. Many researchers have addressed this problem according to different conditions and limitations, but modelling the 3-D space and routing with an evolutional algorithm ...
Hakimeh Mazaheri +2 more
doaj +1 more source
Digital BusinessA paradox arises in platform-based open innovation, wherein digital Multi-Sided Platform (MSP) firms with little initial co-creation ability can successfully adopt an open innovation strategy that typically requires a high level of co-creation capacity ...
Adhi Setyo Santoso
doaj +1 more source
A Complete Mechanism for Tolerating Multiple Failures Using Open Shortest Path First Protocol (OSPF)
Menoufia Journal of Electronic Engineering Research, 2011 It is necessary for the network to be available most of the time and to achieve transparent network failure recovery: In this paper a complete mechanism for tolerating multiple failures is described. This mechanism obtains a spanning tree form automatically in response of failures exploiting the properties of the used routing protocol. This mechanism
Khameis M. El-shennawy +2 more
openaire +2 more sources
jCompoundMapper: An open source Java library and command-line tool for chemical fingerprints
Journal of Cheminformatics, 2011 Background The decomposition of a chemical graph is a convenient approach to encode information of the corresponding organic compound. While several commercial toolkits exist to encode molecules as so-called fingerprints, only a few open source ...
Hinselmann Georg +4 more
doaj +1 more source
Two betweenness centrality measures based on Randomized Shortest Paths
, 2016 This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods ...
Kivimäki, Ilkka +3 more
core +1 more source
, 2015 A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified root edge ...
Eppstein, David +2 more
core +1 more source
SSL: Signal Similarity-Based Localization for Ocean Sensor Networks
Sensors, 2015 Nowadays, wireless sensor networks are often deployed on the sea surface for ocean scientific monitoring. One of the important challenges is to localize the nodes’ positions.
Pengpeng Chen +3 more
doaj +1 more source
Pedestrian route choice: an empirical study [PDF]
, 1997 There has been relatively little work done on route choice for pedestrians. The present paper addresses this issue by using a sample survey of daily walks in a UK urban area.
Heydecker, BG, Verlander, NQ
core
Future InternetThe purpose of this study is to evaluate and compare how well different routing protocols perform in terms of load sharing, link failover, and overall network performance.
Kamal Shahid +2 more
doaj +1 more source