Results 41 to 50 of about 407,365 (309)
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
The shortest path problem on large‐scale real‐road networks [PDF]
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
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
Conditional shortest path routing in delay tolerant networks
Delay tolerant networks are characterized by the sporadic connectivity between their nodes and therefore the lack of stable end-to-end paths from source to destination. Since the future node connections are mostly unknown in these networks, opportunistic
E. Bulut, S. Geyik, B. Szymański
semanticscholar +1 more source
On the cycle polytope of a directed graph and its relaxations [PDF]
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.
C. GAVOILLE+4 more
openaire +10 more sources
Recently, the Internet of Things (IoT) is widely considered in vehicular ad-hoc networks (VANETs) for use in intelligent transportation systems. In particular, the pervasive deployment of different sensors in modern vehicles has unlocked interesting ...
Habeeb Bello-Salau+4 more
doaj +1 more source
k-Strong Shortest Path Union Cover for Certain Graphs and Networks [PDF]
The k-distance strong shortest path union cover of a graph is the minimum cardinality among all strong shortest path union cover at distance k of G. In this paper we determine the 2-strong shortest path union cover for certain graphs, also we prove that the k-strong shortest path union cover problem, in general, is NP-complete.
arxiv
Different Apple Varieties Classification Using kNN and MLP Algorithms [PDF]
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
Reliability-Aware Multi-Source Multicast Hybrid Routing in Softwarized Networks
Undoubtedly, these days our telecommunication networks are witnessing not only a major spike is data volumes, but also a shift in the mode of communications.
Long Qu, Chadi Assi
doaj +1 more source
IDMF is a derivative of dimethyl fumarate (DMF) with a unique therapeutic potential at the intersection of psoriasis and multiple sclerosis. Here, we demonstrate that it compares favorably with DMF and its other derivatives, such as Diroximel, in the zebrafish, microglia, and lymphocyte models.
Yulin He+5 more
wiley +1 more source