Deepqgho: Quantized greedy hyperparameter optimization in deep neural networks for on-the-fly learning
On-the-fly learning is unavoidable for applications that demand instantaneous deep neural
network (DNN) training or where transferring data to the central system for training is costly …
network (DNN) training or where transferring data to the central system for training is costly …
Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
S Mukherjee - Journal of Mathematical Modelling and Algorithms, 2012 - Springer
In this paper, a well known problem called the Shortest Path Problem (SPP) has been
considered in an uncertain environment. The cost parameters for traveling each arc have …
considered in an uncertain environment. The cost parameters for traveling each arc have …
DCACA: Dual-Model Consensus-Based Anti-Risk Confidence Allocation Trust Management in IoVs
With the development of Internet of Vehicles (IoVs), data security emerges as a significant
challenge, especially regarding data tampering and the spread of false information. While …
challenge, especially regarding data tampering and the spread of false information. While …
Multidimensional Trust Evidence Fusion and Path-Backtracking Mechanism for Trust Management in VANETs
With the development of vehicular ad-hoc networks (VANETs), several data security
challenges are revealed, such as data hijacking and interception. Although vehicles are …
challenges are revealed, such as data hijacking and interception. Although vehicles are …
Delivery of pedestrian real-time location and routing information to mobile architectural guide
The research presented in this paper focuses on the use of different computing and wireless
techniques and technological systems for real-time navigation support and location based …
techniques and technological systems for real-time navigation support and location based …
Route planning based on uncertain information in transport networks
G Szűcs - Transport, 2012 - Taylor & Francis
The goal of this paper is to find a solution for route planning in a transport network where the
network type can be arbitrary: a network of bus routes, a network of tram rails, a road …
network type can be arbitrary: a network of bus routes, a network of tram rails, a road …
Route planning with uncertain information using Dempster-Shafer theory
The aim of this paper is to find a solution for route planning in a road network, where the
costs of roads are uncertain. Our concept is based on the Dempster-Shafer theory and …
costs of roads are uncertain. Our concept is based on the Dempster-Shafer theory and …
[HTML][HTML] Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
In this paper we present hybrid algorithms for the single-source shortest-paths (SSSP) and
for the all-pairs shortest-paths (APSP) problems, which are asymptotically fast when run on …
for the all-pairs shortest-paths (APSP) problems, which are asymptotically fast when run on …
Study on near-optimal path finding strategies in a road network
S Jun, L Jian-Yuan, C Han… - Journal of Algorithms & …, 2008 - journals.sagepub.com
In this paper we analyze the existing defects of hierarchical and nonhierarchical path finding
algorithm respectively in detail and present a hierarchical path finding algorithm based on …
algorithm respectively in detail and present a hierarchical path finding algorithm based on …
Vehicle-based interactive management with multi-agent approach
YM Chen, BY Wang - … of Industrial Engineering and Management (JIEM …, 2009 - econstor.eu
Under the energy crisis and global warming, mass transportation becomes more important
than before. The disadvantages of mass transportation, plus the high flexibility and efficiency …
than before. The disadvantages of mass transportation, plus the high flexibility and efficiency …