Results 281 to 290 of about 5,221,882 (331)

Energy-Efficient Relay-Selection-Based Dynamic Routing Algorithm for IoT-Oriented Software-Defined WSNs

IEEE Internet of Things Journal, 2020
In this article, a dynamic routing algorithm based on energy-efficient relay selection (RS), referred to as DRA-EERS, is proposed to adapt to the higher dynamics in time-varying software-defined wireless sensor networks (SDWSNs) for the Internet-of ...
Zhaoming Ding, Lianfeng Shen, Hongyang Chen, Feng Yan, N. Ansari   +4 more
semanticscholar   +1 more source

Deep Policy Dynamic Programming for Vehicle Routing Problems

Integration of AI and OR Techniques in Constraint Programming, 2021
Routing problems are a class of combinatorial problems with many practical applications. Recently, end-to-end deep learning methods have been proposed to learn approximate solution heuristics for such problems. In contrast, classical dynamic programming (
W. Kool, H. V. Hoof, J. Gromicho, M. Welling   +3 more
semanticscholar   +1 more source

SkipNet: Learning Dynamic Routing in Convolutional Networks

European Conference on Computer Vision, 2017
While deeper convolutional networks are needed to achieve maximum accuracy in visual perception tasks, for many inputs shallower networks are sufficient. We exploit this observation by learning to skip convolutional layers on a per-input basis.
Xin Wang, F. Yu, Zi-Yi Dou, Joseph E. Gonzalez   +3 more
semanticscholar   +1 more source

Harder Tasks Need More Experts: Dynamic Routing in MoE Models

arXiv.org
In this paper, we introduce a novel dynamic expert selection framework for Mixture of Experts (MoE) models, aiming to enhance computational efficiency and model performance by adjusting the number of activated experts based on input difficulty.
Quzhe Huang, Zhenwei An, Zhuang Nan, Mingxu Tao, Chen Zhang, Yang Jin, Kun Xu, Liwei Chen, Songfang Huang, Yansong Feng   +9 more
semanticscholar   +1 more source

Flash: efficient dynamic routing for offchain networks

Conference on Emerging Network Experiment and Technology, 2019
Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants make payments through offchain networks instead of committing transactions on-chain.
Peng Wang, Hong Xu, Xin Jin, Tao Wang
semanticscholar   +1 more source

Dynamic route descriptions

Proceedings of the 2nd international symposium on Smart graphics, 2002
Principles are empirically established for various multimodal representations of route descriptions that are found to facilitate aspects of user navigation performance on significantly different levels. Some representations clearly minimize navigation completion time, navigation error, and/or distraction to focal view, while others hinder these goals ...
C. M. Chewar, D. Scott McCrickard
openaire   +1 more source

Harder Task Needs More Experts: Dynamic Routing in MoE Models

Annual Meeting of the Association for Computational Linguistics
In this paper, we introduce a novel dynamic expert selection framework for Mixture of Experts (MoE) models, aiming to enhance computational efficiency and model performance by adjusting the number of activated experts based on input difficulty.
Quzhe Huang, Zhenwei An, Zhuang Nan, Mingxu Tao, Chen Zhang, Yang Jin, Kun Xu, Liwei Chen, Songfang Huang, Yansong Feng   +9 more
semanticscholar   +1 more source

Lung cancer computed tomography image classification using Attention based Capsule Network with dispersed dynamic routing

Expert Syst. J. Knowl. Eng.
Lung cancer is relying as one of the significant and leading cause for the deaths which are based on cancer. So, an effective diagnosis is a crucial step to save the patients who are all dying due to lung cancer. Moreover, the diagnosis must be performed
Ramya Paramasivam, Sujata N. Patil, Srinivas Konda, K. L. Hemalatha   +3 more
semanticscholar   +1 more source

D3R-Net: Dynamic Routing Residue Recurrent Network for Video Rain Removal

IEEE Transactions on Image Processing, 2019
In this paper, we address the problem of video rain removal by considering rain occlusion regions, i.e., very low light transmittance for rain streaks.
Jiaying Liu, Wenhan Yang, Shuai Yang, Zongming Guo   +3 more
semanticscholar   +1 more source

Greedy Dynamic Routing on Arrays

Journal of Algorithms, 1998
Summary: We study the problem of dynamic routing on arrays. We prove that a large class of greedy algorithms perform very well on average. In the dynamic case, when the arrival rate of packets in an \(N\times N\) array is at most 99\% of network capacity, we establish an exponential bound on the tail of the delay distribution. Moreover, we show that in
Kahale, Nabil, Leighton, Tom
openaire   +2 more sources