Learn More
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman(More)
  • Adnan Hadi M. Al-Helali, H. A. Ali, Buthainah Al-Dulaimi, A. Mahmmoud
  • 2009
Problem statement: Image fusion is a process by which multispectral and panchromatic images, or some of their features, are combined together to form a high spatial/high spectral resolutions image. The successful fusion of images acquired from different modalities or instruments is a great importance issue in remote sensing applications. Approach: A new(More)
Problem statement: Generalization feature enhancement of neural networks, especially feed forward structural model has limited progress. The major reason behind such limitation is attributed to the principal definition and the inability to interpret it into convenient structure. Traditional schemes, unfortunately have regarded generalization as an innate(More)
In this paper, the already recognized NP Complete problem which is Travelling Salesman Problem which is also known as TSP, is addressed and its performance is analyzed. For a large and complex data set, a particular neural network is needed to focus on a particular component of the problem, after which combining of all the networks together is required. The(More)
Problem statement: An automated software package is developed for quantifying Luteinizing Hormone (LH) release from pituitary gonadotropes in response to short pulses of gonadotropin-releasing hormone (GnRH). Approach: These computer programs were designed to accommodate the release mechanism that consists of three stages, namely; (1) Production of(More)