Results 31 to 40 of about 50,964 (251)
Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method [PDF]
, 1999 We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs $\Theta (n^2)$ bits are necessary
Buhrman, Harry +2 more
core +6 more sources
Link Prediction using Top-$k$ Shortest Distances
, 2017 In this paper, we apply an efficient top-$k$ shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Our results
Lebedev, Andrei +3 more
core +1 more source
MAP: Medial Axis Based Geometric Routing in Sensor Networks [PDF]
, 2005 One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication.
Bruck, Jehoshua +2 more
core +1 more source
The shortest path problem on large‐scale real‐road networks [PDF]
Networks, 2006 AbstractThe computation of shortest paths between different locations on a road network appears to be a key problem in many applications. Often, a shortest path is required in a very short time. In this article, we try to find an answer to the question of which shortest path algorithm for the one‐to‐one shortest path problem runs fastest on a large ...
Cheng-Kuan Lin +3 more
openaire +10 more sources
An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks
International Journal of Optics, 2014 Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of ...
Huanlin Liu, Qinren Shen, Yong Chen
doaj +1 more source
On the cycle polytope of a directed graph and its relaxations [PDF]
Networks, 2007 AbstractWe continue the investigation of the cycle polytope of a digraph begun by Balas and Oosten (Networks 36 (2000), 34–46) and derive a rich family of facets that cut off the origin and are not related to facets of the traveling salesman polytope.
Gavoille, Cyril +4 more
openaire +8 more sources
Different Apple Varieties Classification Using kNN and MLP Algorithms [PDF]
International Journal of Intelligent Systems and Applications in Engineering, 2016 The User Knowledge Modelling dataset in the UCI machine learning repository was used in this study. The students were classified into 4 class (very low, low, middle, and high) due to the 5 performance data in the dataset. 258 data of 403 data in the dataset were used for training and 145 of them were used for tests.
GANİ, Ahmet +4 more
openaire +65 more sources
IEEE Access, 2019 Compressed sensing technology is one of the effective techniques to effectively reduce the amount of data transmission in wireless sensor networks. Compressed sensing technology can reduce the amount of data that a node undertakes from n to m, where m ...
Yicong Yuan +5 more
doaj +1 more source
IEEE Access, 2021 Neuromorphic systems have shown improvements over the years, leveraging Spiking neural networks (SNN) event-driven nature to demonstrate low power consumption.
Ogbodo Mark Ikechukwu +2 more
doaj +1 more source
Logical topology design for IP rerouting: ASONs versus static OTNs [PDF]
, 2011 IP-based backbone networks are gradually moving to a network model consisting of high-speed routers that are flexibly interconnected by a mesh of light paths set up by an optical transport network that consists of wavelength division multiplexing (WDM ...
Colle, Didier +7 more
core +1 more source