Search Results - (( problem using connection algorithm ) OR ( java application reoptimize algorithm ))

Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

“…It also minimizes the problems of coverage hole and overlapping while guaranteeing a reasonable connectivity quality. …”
Get full text
Get full text
Get full text

A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

“…In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. …”
Get full text
Get full text

Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

Travelling Salesman Problem using Prim Algorithm in High Performance Computing by Wan Harun, Wan Nurhafizah

“…TSP has been used in The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland and Usefulness of Solution Algorithms of the Travelling Salesman Problem in the typing of Biological Sequences in a Clinical Laboratory Setting.…”
Get full text
Get full text

Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

“…To avoid this crosstalk, a time domain approach is used, which is to partition the set of permutation connections into several subsets such that the connections in each subset can be established simultaneously in the network without crosstalk. …”
Get full text
Get full text

Deterministic static sensor node placement in wireless sensor network based on territorial predator scent marking behavior by Abidin H.Z., Din N.M., Radzi N.A.M.

“…Full connectivity is provisioned for all TPSMA approaches since the constraint of the optimization problem is to ensure the connectivity from all sensor nodes to the sink node.…”

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…Each of these nodes is connected to each other through interconnection networks and passes message using a standard message passing mechanism. …”
Get full text
Get full text
Get full text

An immune-genetic algorithm with tabu local search for network intrusion detection system / Hamizan Suhaimi by Suhaimi, Hamizan

“…This issue highlights the need to tackle the network intrusion problem efficiently. This research aim is to study the performance of an improvised Genetic Algorithm (GA) by formulating its problem-specific algorithm for network intrusion problem. …”
Get full text
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

“…Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text
Get full text

Profit-based optimal generation scheduling of a microgrid by Muhamad Razali N.M., Hashim A.H.

“…A case study on the difference between grid-connected and islanded operation is presented. The results demonstrate the efficiency of using genetic algorithm to solve the optimization problem. �2010 IEEE.…”

Performance enhancement of AIMD algorithm for congestion avoidance and control by Jasem, Hayder Natiq

“…National Chiao Tung University’s network simulation (NCTUns) has been used in this development to compare the new algorithm with the older versions and determine its advantages over the older versions. …”
Get full text
Get full text

Development Of an Intelligent Controller For Power Quality Enhancement Of Microgrid by Logintheeran A/L Balakrishnan

Immune-genetic algorithm(IGA) with local search for intrusion detection system in computer network / Hamizan Suhaimi, Saiful Izwan Suliman, and Ismail Musirin by Suhaimi, Hamizan, Suliman, Saiful Izwan, Musirin, Ismail

“…By formulating a specific algorithm for this problem, the purpose of this study is to examine the performance of improvised Genetic Algorithms for network intrusion problems. …”
Get full text
Get full text
Get full text

Quality of service management algorithms in WiMAX networks by Saidu, Ibrahim

“…Simulation have been extensively used to evaluate the proposed algorithm. Finally, Discrete Event Simulator (DES) is designed and developed in order to evaluate the performance of the proposed algorithms. …”
Get full text
Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text

Genetic algortihm to solve pcb component placement modeled as travelling salesman problem by Mohd Khazzarul Khazreen, Mohd Zaidi

“…To achieve this result, genetic algorithm technique was used. There are several objectives set for this research which all of them connected to the title itself which is about genetic algorithm as an alternative to solve PCB component modeled as TSP problem. …”
Get full text
Get full text

Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem by ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim

“…Two algorithms (WWM1 and WWM2) are proposed for solving this problem. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text