NSTL国家科技图书文献中心

1. DrATC: Dynamic Routing Algorithm Based on Trust Characteristics NSTL国家科技图书文献中心

Davide Ferraris | Lorenzo Monti - 《Security and Trust Management》 - International Workshop on Security and Trust Management - 2025, - 3～20 - 共18页

摘要：In this paper, we propose a dynamic routing | allows the routing* protocol to selectively incorporate* | trust-based routing. This work contributes to the | incorporating trust into dynamic routing* decisions, paving the* | algorithm that leverages various trust characteristics to

关键词： Trust | Network | Routing

2. A Vehicular Network Routing Based on the DQN Algorithm in the Cloud Environment NSTL国家科技图书文献中心

Mingzhu Ge | Liya Xu ... - 《Cloud Computing - CLOUD 2024》 - International Conference on Cloud Computing | Services Conference Federation - 2025, - 37～45 - 共9页

摘要： presents a vehicular network* routing scheme based on the* | current quality of routing* services is unassured. The* | . This paper conducts research on the routing* problem* | DQN algorithm. The service nodes make routing | The Internet of Vehicles (IoVs), composed of

关键词： IoVs | Routing | Cloud computing

3. Escape Routing Using Deep Reinforcement Learning NSTL国家科技图书文献中心

Hsu Fu Cheng | Dun Wei Cheng - 《International Workshop on Advanced Imaging Technology (IWAIT) 2025》 - International Workshop on Advanced Imaging Technology - 2025, - 135101B.1～135101B.5 - 共5页

摘要：Escape routing* is a critical task in the* | routing problem. The problem is modeled as a Markov | routing strategies through interactions with the | routing problems, offering a novel approach to | addressing routing* challenges in PCB design.*

关键词： Escape routing | Deep reinforcement learning | Printed circuit boards

4. Research on priority-driven routing protocol for MANETs NSTL国家科技图书文献中心

Tieshuai Zhang | Peng Liu ... - 《Fourth International Conference on Advanced Manufacturing Technology and Electronic Information (AMTEI 2024)》 - International Conference on Advanced Manufacturing Technology and Electronic Information - 2025, - 135151W.1～135151W.9 - 共9页

摘要： priority-driven mobile ad hoc network* routing protocol* | Distance Vector (AODV) routing* protocol, incorporates a* | In recent years, Mobile Ad Hoc Networks | (MANETs) have been widely applied in various fields such | as military missions, ecological surveillance

关键词： Routing protocol | Mobile ad hoc networks | Dynamic on-Demand distance vector routing protocol | Priority-Driven

5. A Heuristic Solution Approach for Bulk Port Routing Optimization NSTL国家科技图书文献中心

Sara Mallah | Oulaid Kamach ... - 《Numerical Computations,Part I》 - International Conference on Numerical Computations: Theory and Algorithms - 2025, - 343～350 - 共8页

摘要： routing problem a strongly demanded optimization issue | to solve. To solve the routing* problem, we proposed* | scenarios and provide better routing* plan. The proposed* | In today's world, the links between suppliers | and customers are neither simple nor direct due to

关键词： Routing problem | Bulk ports | Belt-conveyor transportation

6. Safe Multi-agent Reinforcement Learning for Drone Routing Problems NSTL国家科技图书文献中心

Masahiro Kaji | Donghui Lin ... - 《PRIMA 2024: Principles and Practice of Multi-Agent Systems》 - International Conference on Principles and Practice of Multi-Agent Systems - 2025, - 329～334 - 共6页

摘要：Drone Routing* Problems (DRP) focus on finding* | optimal paths for autonomous drones in a graph-based | environment, minimizing movement costs and avoiding | collisions. DRP is modeled as a cooperative multi-agent | problem, for which Multi-Agent Reinforcement Learning

关键词： Drone routing problems | Multi-agent reinforcement learning | Safe reinforcement learning

7. Routability-driven Ordered Escape Routing Method based on Neural Network NSTL国家科技图书文献中心

Hung Liang Yeh | Dun Wei Cheng - 《International Workshop on Advanced Imaging Technology (IWAIT) 2025》 - International Workshop on Advanced Imaging Technology - 2025, - 1351012.1～1351012.6 - 共6页

摘要： address the Ordered Escape Routing* (OER) problem. The* | ensuring that the routing* paths do not cross* | neural networks (NN) to predict feasible routing* paths* | This study presents an innovative approach | that utilizes neural network-based techniques to

关键词： Printed circuit board | Ordered escape routing | Convolutional neural network | Long short-Term memory networks | A* algorithm

8. Prediction of instruction SDC vulnerability in routing algorithms based on graph convolutional network NSTL国家科技图书文献中心

Zhijun Liu | Yi Zhuang - 《Fourth International Conference on Network Communication and Information Security (ICNCIS 2024)》 - International Conference on Network Communication and Information Security - 2025, - 135160X.1～135160X.7 - 共7页

摘要： of network* routing algorithms based on GCN (Graph* | reliability of routing* algorithms in network communication* | on routing* algorithms is analyzed, and a fault* | model of the routing* algorithm is constructed. Next* | dependencies of the routing* algorithm are extracted to*

关键词： Transient fault | Silent data corruption | Routing algorithm | Graph convolutional network

9. Optimal Non-crossing Escape Routing on Grid Pin Array using Genetic Algorithm NSTL国家科技图书文献中心

Shun Pin Chuang | Dun Wei Cheng - 《International Workshop on Advanced Imaging Technology (IWAIT) 2025》 - International Workshop on Advanced Imaging Technology - 2025, - 1351014.1～1351014.6 - 共6页

摘要：) to address the non-crossing escape routing* problem* | routing efficiency by minimizing total wire length while | to solving the non-crossing escape routing* problem* | achieving an optimal balance between routing* efficiency* | This paper proposes a genetic algorithm (GA

关键词： Printed circuit board | Genetic algorithm | Escape routing

10. Solving the Clustered Minimum Routing Tree Problem Using Prufer-Coding Based Hybrid Genetic Algorithms NSTL国家科技图书文献中心

Cosmin Sabo | Bogdan Teglas ... - 《Hybrid Artificial Intelligent Systems,Part I》 - International Conference on Hybrid Artificial Intelligence Systems - 2025, - 312～323 - 共12页

摘要：The clustered minimum routing* tree problem* | (CluMRTP) extends the classical minimum routing* tree* | CluMRTP is to find a minimum-cost routing* tree ensuring* | problem by considering a graph with vertices divided | into a given number of clusters. The scope of the

摘要：In this paper, we propose a dynamic routing | allows the routing* protocol to selectively incorporate* | trust-based routing. This work contributes to the | incorporating trust into dynamic routing* decisions, paving the* | algorithm that leverages various trust characteristics to

关键词： Trust | Network | Routing

摘要： presents a vehicular network* routing scheme based on the* | current quality of routing* services is unassured. The* | . This paper conducts research on the routing* problem* | DQN algorithm. The service nodes make routing | The Internet of Vehicles (IoVs), composed of

关键词： IoVs | Routing | Cloud computing

摘要：Escape routing* is a critical task in the* | routing problem. The problem is modeled as a Markov | routing strategies through interactions with the | routing problems, offering a novel approach to | addressing routing* challenges in PCB design.*

关键词： Escape routing | Deep reinforcement learning | Printed circuit boards

摘要： priority-driven mobile ad hoc network* routing protocol* | Distance Vector (AODV) routing* protocol, incorporates a* | In recent years, Mobile Ad Hoc Networks | (MANETs) have been widely applied in various fields such | as military missions, ecological surveillance

关键词： Routing protocol | Mobile ad hoc networks | Dynamic on-Demand distance vector routing protocol | Priority-Driven

摘要： routing problem a strongly demanded optimization issue | to solve. To solve the routing* problem, we proposed* | scenarios and provide better routing* plan. The proposed* | In today's world, the links between suppliers | and customers are neither simple nor direct due to

关键词： Routing problem | Bulk ports | Belt-conveyor transportation

摘要：Drone Routing* Problems (DRP) focus on finding* | optimal paths for autonomous drones in a graph-based | environment, minimizing movement costs and avoiding | collisions. DRP is modeled as a cooperative multi-agent | problem, for which Multi-Agent Reinforcement Learning

关键词： Drone routing problems | Multi-agent reinforcement learning | Safe reinforcement learning

摘要： address the Ordered Escape Routing* (OER) problem. The* | ensuring that the routing* paths do not cross* | neural networks (NN) to predict feasible routing* paths* | This study presents an innovative approach | that utilizes neural network-based techniques to

关键词： Printed circuit board | Ordered escape routing | Convolutional neural network | Long short-Term memory networks | A* algorithm

摘要： of network* routing algorithms based on GCN (Graph* | reliability of routing* algorithms in network communication* | on routing* algorithms is analyzed, and a fault* | model of the routing* algorithm is constructed. Next* | dependencies of the routing* algorithm are extracted to*

关键词： Transient fault | Silent data corruption | Routing algorithm | Graph convolutional network

摘要：) to address the non-crossing escape routing* problem* | routing efficiency by minimizing total wire length while | to solving the non-crossing escape routing* problem* | achieving an optimal balance between routing* efficiency* | This paper proposes a genetic algorithm (GA

关键词： Printed circuit board | Genetic algorithm | Escape routing

摘要：The clustered minimum routing* tree problem* | (CluMRTP) extends the classical minimum routing* tree* | CluMRTP is to find a minimum-cost routing* tree ensuring* | problem by considering a graph with vertices divided | into a given number of clusters. The scope of the

关键词： Hybrid genetic algorithms | Minimum routing tree problem | Clustered minimum routing tree problem

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：In this paper, we propose a dynamic routing | allows the routing protocol to selectively incorporate | trust-based routing. This work contributes to the | incorporating trust into dynamic routing decisions, paving the | algorithm that leverages various trust characteristics to

关键词： Trust | Network | Routing

摘要： presents a vehicular network routing scheme based on the | current quality of routing services is unassured. The | . This paper conducts research on the routing problem | DQN algorithm. The service nodes make routing | The Internet of Vehicles (IoVs), composed of

关键词： IoVs | Routing | Cloud computing

摘要：Escape routing is a critical task in the | routing problem. The problem is modeled as a Markov | routing strategies through interactions with the | routing problems, offering a novel approach to | addressing routing challenges in PCB design.

关键词： Escape routing | Deep reinforcement learning | Printed circuit boards

摘要： priority-driven mobile ad hoc network routing protocol | Distance Vector (AODV) routing protocol, incorporates a | In recent years, Mobile Ad Hoc Networks | (MANETs) have been widely applied in various fields such | as military missions, ecological surveillance

关键词： Routing protocol | Mobile ad hoc networks | Dynamic on-Demand distance vector routing protocol | Priority-Driven

摘要： routing problem a strongly demanded optimization issue | to solve. To solve the routing problem, we proposed | scenarios and provide better routing plan. The proposed | In today's world, the links between suppliers | and customers are neither simple nor direct due to

关键词： Routing problem | Bulk ports | Belt-conveyor transportation

摘要：Drone Routing Problems (DRP) focus on finding | optimal paths for autonomous drones in a graph-based | environment, minimizing movement costs and avoiding | collisions. DRP is modeled as a cooperative multi-agent | problem, for which Multi-Agent Reinforcement Learning

关键词： Drone routing problems | Multi-agent reinforcement learning | Safe reinforcement learning

摘要： address the Ordered Escape Routing (OER) problem. The | ensuring that the routing paths do not cross | neural networks (NN) to predict feasible routing paths | This study presents an innovative approach | that utilizes neural network-based techniques to

关键词： Printed circuit board | Ordered escape routing | Convolutional neural network | Long short-Term memory networks | A* algorithm

摘要： of network routing algorithms based on GCN (Graph | reliability of routing algorithms in network communication | on routing algorithms is analyzed, and a fault | model of the routing algorithm is constructed. Next | dependencies of the routing algorithm are extracted to

关键词： Transient fault | Silent data corruption | Routing algorithm | Graph convolutional network

摘要：) to address the non-crossing escape routing problem | routing efficiency by minimizing total wire length while | to solving the non-crossing escape routing problem | achieving an optimal balance between routing efficiency | This paper proposes a genetic algorithm (GA

关键词： Printed circuit board | Genetic algorithm | Escape routing

摘要：The clustered minimum routing tree problem | (CluMRTP) extends the classical minimum routing tree | CluMRTP is to find a minimum-cost routing tree ensuring | problem by considering a graph with vertices divided | into a given number of clusters. The scope of the

关键词： Hybrid genetic algorithms | Minimum routing tree problem | Clustered minimum routing tree problem

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：In this paper, we propose a dynamic routing | allows the routing* protocol to selectively incorporate* | trust-based routing. This work contributes to the | incorporating trust into dynamic routing* decisions, paving the* | algorithm that leverages various trust characteristics to

摘要： presents a vehicular network* routing scheme based on the* | current quality of routing* services is unassured. The* | . This paper conducts research on the routing* problem* | DQN algorithm. The service nodes make routing | The Internet of Vehicles (IoVs), composed of

摘要：Escape routing* is a critical task in the* | routing problem. The problem is modeled as a Markov | routing strategies through interactions with the | routing problems, offering a novel approach to | addressing routing* challenges in PCB design.*

摘要： priority-driven mobile ad hoc network* routing protocol* | Distance Vector (AODV) routing* protocol, incorporates a* | In recent years, Mobile Ad Hoc Networks | (MANETs) have been widely applied in various fields such | as military missions, ecological surveillance

摘要： routing problem a strongly demanded optimization issue | to solve. To solve the routing* problem, we proposed* | scenarios and provide better routing* plan. The proposed* | In today's world, the links between suppliers | and customers are neither simple nor direct due to

摘要：Drone Routing* Problems (DRP) focus on finding* | optimal paths for autonomous drones in a graph-based | environment, minimizing movement costs and avoiding | collisions. DRP is modeled as a cooperative multi-agent | problem, for which Multi-Agent Reinforcement Learning

摘要： address the Ordered Escape Routing* (OER) problem. The* | ensuring that the routing* paths do not cross* | neural networks (NN) to predict feasible routing* paths* | This study presents an innovative approach | that utilizes neural network-based techniques to

摘要： of network* routing algorithms based on GCN (Graph* | reliability of routing* algorithms in network communication* | on routing* algorithms is analyzed, and a fault* | model of the routing* algorithm is constructed. Next* | dependencies of the routing* algorithm are extracted to*

摘要：) to address the non-crossing escape routing* problem* | routing efficiency by minimizing total wire length while | to solving the non-crossing escape routing* problem* | achieving an optimal balance between routing* efficiency* | This paper proposes a genetic algorithm (GA

摘要：The clustered minimum routing* tree problem* | (CluMRTP) extends the classical minimum routing* tree* | CluMRTP is to find a minimum-cost routing* tree ensuring* | problem by considering a graph with vertices divided | into a given number of clusters. The scope of the