#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1987

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Shaharuddin Salleh, Bahrom Sanugi, Hishamuddin Jamaluddin, Stephan Olariu, Albert Y. Zomaya
- The Journal of Supercomputing
- 2002

This paper presents ESSR (Enhanced Simulated annealing for Single-row Routing) model for solving the single-row routing problem. The main objective in this problem is to produce a realization that minimizes both the street congestion and the number of doglegs. Simulated annealing (SA) is a stochastic, hill-climbing and gradient-descent technique based on… (More)

In this paper, we propose a dynamic task scheduling technique based on fuzzy logic. The main objective of the work is to implement load balancing in scheduling tasks on a network of processing elements. The fuzzy engine we propose is capable of processing inputs from incomplete and ambiguous data that arises from the current state of the processors. In the… (More)

- Shaharuddin Salleh, Stephan Olariu, Bahrom Sanugi, Mohd Ismail Abd Aziz
- The Journal of Supercomputing
- 2005

A complete graph is a fully-connected graph where every node is adjacent to all other nodes in the graph. Very often, many applications in science and engineering are reducible to this type of graph. Hence, a simplified form of a complete graph contributes in providing the solutions to these problems. In this paper, we present a technique for transforming a… (More)

- Hazura Mohamed, Muhammad Hisyam Lee, Shaharuddin Salleh, Bahrom Sanugi, Mazalan Sarahintu
- Proceedings of the 2011 International Conference…
- 2011

This paper presents an approach for tackling multiple metrics and various network parameters simultaneously to investigate the performance of wireless ad-hoc network routing protocols. The study uses Taguchi's loss function to determine the best condition in yielding maximum throughput and minimum packet drop and routing overhead simultaneously for dynamic… (More)

- Abdelaziz Hamad, Bahrom Sanugi, Shaharuddin Salleh
- Int. J. Comput. Math.
- 2003

- David J. Evans, Bahrom Sanugi
- Parallel Computing
- 1989

This paper presents an approach for scheduling under a common due date on parallel unrelated machine problems based on artificial neural network. The objective is to allocate and sequence the jobs on the machines so that the total cost be minimized. This cost is composed of the total earliness and the total tardiness cost. Neural network is a suitable model… (More)

We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very… (More)