Search Results - (( data selection path algorithm ) OR ( parallel evaluation case algorithm ))

Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

“…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
Get full text
Get full text

Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

“…All the numerical results are given to illustrate the algorithms developed for the cases that we were tested. …”
Get full text
Get full text

Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

“…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
Get full text
Get full text

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

Get full text
Get full text
Get full text
Get full text

An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network by Wan Isni Sofiah, Wan Din, Asyran Zarizi, Abdullah, Razulaimi, Razali, Ahmad Firdaus, Zainal Abidin, Salwana, Mohamad, Eh Phon, Danakorn Nincarean, Cik Feresa, Mohd Foozy

“…When this happens, the sensor node cannot receive and send the data until the energy is renewed. To reduce WSN energy consumption, the process of selecting a path to the destination is very important. …”
Get full text
Get full text
Get full text
Get full text

A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

“…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
Get full text
Get full text

Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

“…Similarly, when data parallelism is introduced in the algorithm the performance of the algorithm improved further by 12% in latency and 17% in throughput when compared to PDWA algorithm. …”
Get full text
Get full text
Get full text

Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

“…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
Get full text
Get full text
Get full text

Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

“…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
Get full text
Get full text

Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

“…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text

Predetermined path of mobile data gathering in wireless sensor networks based on network layout by Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

“…Thus, within each of these divided areas, the multi-hop collection is deployed as a sub-set to the main collection. The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. …”
Get full text
Get full text

A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

“…The system is then used in path prediction mode for reconstructing the missing parts of the trajectory when actual positioning data is unavailable. …”
Get full text
Get full text

A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults by Zakari, Abubakar, Lee, Sai Peck, Targio Hashem, Ibrahim Abaker

“…Multiple faults in a program may reduce the effectiveness of the existing fault localization techniques due to the complex relationship between faults and failures in the presence of multiple faults. In an ideal case, faults are isolated into fault-focused clusters, each targeting a single fault for developers to localize them simultaneously in parallel. …”
Get full text
Get full text

Novel Link Establishment Communication Scheme against Selfish Attack Using Node Reward with Trust Level Evaluation Algorithm in MANET by Hemalatha, S., Kshirsagar, P.R., Manoharan, H., Vasantha Gowri, N., Vani, A., Qaiyum, S., Vijayakumar, P., Tirth, V., Haleem, S.L.A., Chakrabarti, P., Teressa, D.M.

“…This scheme selects genuine node for routing path production, by using the node reward with dependence level estimating algorithm to compute every node trust level and resource range, to disconnect higher trust level node and lower trust level node; higher trust level node is a genuine node which performs secure communication. …”
Get full text
Get full text

A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network by Almuslehi, Hussein Saad Mohammed

“…Pheromone trails mark efficient routes, reinforcing paths with higher pheromone concentrations. This optimizes data transmission, enhances energy efficiency, and extends network longevity. …”
Get full text
Get full text
Get full text

Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

“…The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. …”
Get full text
Get full text

Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

“…The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. …”
Get full text
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

Improving Network Consistency and Data Availability Using Fuzzy C Mean Clustering Algorithm in Wireless Sensor Networks by Mujahid Tabassum

Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization by Pang, Jia Hong

“…This research work involves the implementation of Single Objective Genetic Algorithm (SOGA) and Multi-objectives Genetic Algorithm (MOGA) in a 16-point Radix-4 Single Path Delay Feedback (R4SDF) pipelined Fast Fourier Transform (FFT) processor. …”
Get full text
Get full text