Search Results - (( java application optimized algorithm ) OR ( using tree ((data algorithm) OR (path algorithm)) ))

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
Get full text

Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

“…ImpTR protocol uses an approach to select next hope depending on new algorithm and uses the same tree topology construction for distributing address to all sensor nodes in the network. …”
Get full text
Get full text

An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points by Ghaleb, Mukhtar, K. Subramaniam, Shamala, Ghaleb, Safwan Mahmood Yahya

“…The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. …”
Get full text
Get full text
Get full text

Nano-scale VLSI clock routing module based on useful-skew tree algorithm by Eik Wee, Chew, Heng Sun, Ch'ng, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…We implemented Useful-Skew Tree (UST) algorithm which is based on the deferred-merge embedding (DME) paradigm, as the clock layout synthesis engine. …”
Get full text
Get full text

Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

“…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
Get full text
Get full text

A Mininet emulation study for SDN fat tree data center sleep mode routing algorithms by Fawzi S., Din N.M.

“…Employing sleep mode aligns with sustainability goals and can reduce the environmental impact of data centers by lowering carbon emissions. In this work meta heuristic algorithm is incorporated at the SDN central controller in a fat tree-based data centre for bandwidth usage monitoring, sleep decisions and path selection using Mininet emulation. …”

An accelerated and accurate three-dimensional ray tracing using red-black tree with facet mining and object bouncing techniques by Islam, M.J., Reza, A.W., Noordin, K.A., Dimyati, K., Kausar, A.M.Z.

“…Therefore, this study introduces a new 3D ray tracing algorithm based on a red-black tree with facet mining and object bouncing techniques. …”
Get full text
Get full text
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…BST has been used to store the paths that Dijkstra algorithm initialled. …”
Get full text
Get full text
Get full text

Power line corridor vegetation encroachment detection from satellite images using retinanet and support vector machine by Fathi Mahdi Elsiddig Haroun, Mr.

“…A routing algorithm has been developed to create a routing path between all transmission towers in the image, which helps identify the power line path. …”

Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

“…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
Get full text
Get full text

Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

“…Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. …”
Get full text
Get full text

Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks by Abdulla Mogaibel, Hassen Abd-Almotaleb

“…As a result, this thesis proposes a centralized on-demand channel reservation scheme (AODV-MRCR) that provides an efficient way of utilizing the multiradio and multi-channel resources to establish high throughput path for the gateway traffic. To ensure high throughput path, AODV-MRCR uses path optimization as an intelligent mechanism to select a path with least interference and eliminate the intra-flow interference. …”
Get full text
Get full text

Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

“…This study concerns the implementation of Rapidly-Exploring Random Trees (RRTs) algorithm for an autonomous robot path planning. …”
Get full text
Get full text
Get full text

Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

“…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
Get full text
Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
Get full text
Get full text

Analysis & design low power multiplier using TSMC 0.18µm CMOS technology by Norsaifulrudin Mat Zuki

“…By employing the dynamic-range determination unit to control input data paths, the multiplier with a column-based adder tree of compressors or counters is designed. …”
Get full text

A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree by Yincong Ma, Kit Guan Lim, Min Keng Tan, Helen Sin Ee Chuo, Lorita Angeline, Kenneth Tze Kin Teo

“…The improved algorithm is used to obtain the rough obstacle avoidance of the vehicle. …”
Get full text
Get full text
Get full text
Get full text

Research on risk detection of autonomous vehicle based on rapidly-exploring random tree by Yincong Ma, Lim, Kit Guan, Tan, Min Keng, Sin, Helen Ee Chuo, Ali Farzamnia, Tze, Kenneth Kin Teo

“…On the premise of ensuring safety and meeting the requirements of the vehicle’s kinematic constraints through the expansion of obstacles, the dynamic step size is used for random tree growth. A non-particle collision detection (NPCD) collision detection algorithm and path modification (PM) path modification strategy are proposed for the collision risk in the turning process, and geometric constraints are used to represent the possible security threats, so as to improve the efficiency and safety of vehicle global path driving and to provide reference for the research of driverless vehicles.…”
Get full text
Get full text
Get full text
Get full text

Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

Get full text
Get full text

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text