Search Results - (( using execution paths algorithm ) OR ( using optimization method algorithm ))

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

“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text

New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
Get full text
Get full text

Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

“…A MPSO algorithm, without path smoothening, is used for comparison. …”
Get full text
Get full text

A review on autonomous mobile robot path planning algorithms by Noraziah, Adzhar, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…In this paper, commonly use classical approaches such as cell decomposition (CD), roadmap approach (RA), artificial potential field (AFP), and heuristics approaches such as genetic algorithm (GA), particle swarm optimization (PSO) approach and ant colony optimization (ACO) method are considered.It is observed that when it comes to dynamic environment where most of the information are unknown to the mobile robots before starting, heuristics approaches are more popular and widely used compared to classical approaches since it can handle uncertainty, interact with objects and making quick decision. …”
Get full text
Get full text
Get full text

Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal by Fadzal, Ahmad Nazmi

“…Pheromone concept is the main criterion that distinguish ACO to other algorithms. Based on the concept, pheromone saturation is used to combine stackable solution pattern that is discovered while straying to different term node to build a path. …”
Get full text
Get full text

Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

“…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text

Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text

Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari by Johari, Muhammad Aiman

Get full text
Get full text

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

“…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). …”
Get full text
Get full text
Get full text

An overview of mobile robot path planning by Noraziah, Adzhar, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…The classical approaches such as cell decomposition, roadmap approach, artificial potential field (AFP), and heuristics approaches such as genetic algorithm, particle swarm optimization (PSO) approach and ant colony optimization (ACO) method are considered in this study. …”
Get full text
Get full text
Get full text

Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method by A’Qilah Ahmad Dahalan, Azali Saudi, Jumat Sulaiman

“…By carefully choosing the optimal parameter values, the suggested B-MTOR improved the computational execution of the algorithm. …”
Get full text
Get full text
Get full text
Get full text

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

A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

“…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
Get full text

Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

“…The method proposed is to design DNA assembly algorithms in Verilog HDL and implemented it in ASIC design flow. …”
Get full text
Get full text

Ambulance shortest path problem by using link-based algorithm by Lee, Chooi Hua

Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…For example, in the last experiment part of using general height map, the execution time is 10ms with shortest path of 91 node distance compared to Original JPS with 40ms and 122 node distance. …”
Get full text
Get full text
Get full text

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

Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

“…In relation to that, A* algorithm was used as a path finding technique to plan a collision-free-path journey from one location to another. …”
Get full text
Get full text

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”