|
|
|
|
|
Saif Ur Rehman, Muhammad Altaf Khan, Habib Un Nabi, Shaukat Ali, Noha Alnazzawi and Shafiullah Khan
The regular frequent pattern mining (RFPM) approaches are aimed to discover the itemsets with significant frequency and regular occurrence behavior in a dataset. However, these approaches mainly suffer from the following two issues: (1) setting the frequ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yi Zhang, Lanxin Qiu, Yangzhou Xu, Xinjia Wang, Shengjie Wang, Agyemang Paul and Zhefu Wu
Software-Defined Networking (SDN) enhances network control but faces Distributed Denial of Service (DDoS) attacks due to centralized control and flow-table constraints in network devices. To overcome this limitation, we introduce a multi-path routing alg...
ver más
|
|
|
|
|
|
|
|
|
|
|
Junkai Yi and Xiaoyan Liu
Penetration testing is an important method to evaluate the security degree of a network system. The importance of penetration testing attack path planning lies in its ability to simulate attacker behavior, identify vulnerabilities, reduce potential losse...
ver más
|
|
|
|
|
|
|
|
|
|
|
Meng-Yue Zhang, Shi-Chun Yang, Xin-Jie Feng, Yu-Yi Chen, Jia-Yi Lu and Yao-Guang Cao
Route planning for autonomous driving is a global road planning method based on a given starting point and target point combined with current traffic flow information. The optimal global route can reduce traffic jams and improve the safety and economy of...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rakib Hossen, Md Whaiduzzaman, Mohammed Nasir Uddin, Md. Jahidul Islam, Nuruzzaman Faruqui, Alistair Barros, Mehdi Sookhak and Md. Julkar Nayeen Mahi
The Internet of Things (IoT) has seen a surge in mobile devices with the market and technical expansion. IoT networks provide end-to-end connectivity while keeping minimal latency. To reduce delays, efficient data delivery schemes are required for disper...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aydin GULLU, Hilmi KUSÇU
Pág. 222 - 238
Graph search algorithms and shortest path algorithms, designed to allow real mobile robots to search unknown environments, are typically run in a hybrid manner, which results in the fast exploration of an entire environment using the shortest path. In th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabian Gärtner and Peter F. Stadler
Superbubbles are a class of induced subgraphs in digraphs that play an essential role in assembly algorithms for high-throughput sequencing data. They are connected with the remainder of the host digraph by a single entrance and a single exit vertex. Lin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kengo Nakamura and Kunihiko Sadakane
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in ??(??+??)
O
(
n
+
m
)
time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected graph G ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Arif Herwanto,Bambang Eka Purnama
Increasing the number of passengers and the needs of passengers over the years has resulted in many fleet of ground transportation, especially buses. Therefore the use of buses to transport more attractive, especially in solo. However, there are obstacle...
ver más
|
|
|
|
|
|
|
|
|
|
|
Peng, C-H; Wang, B-F; Wang, J-S
Pág. 559 - 570
|
|
|
|
|
|