Research ArticleOpen accessIn the abstractAdaptive Resonance Theory Training Parameters: Pretty Good SetsTaisir Mohammad Eldos, Abdulaziz Suleiman AlmazyadProblem statement: ART1 artificial neural networks offer good tools for test clustering, where no expert is needed if the system is well trained. However, having no output reference for the input patterns makes it hard to judge the quality of the training. Moreover, the performance depends to a great extent on a set of training parameters. Designers follow some recommendations … …Journal of Computer Science, Vol. 6, Issue 12 · 6 Nov 2010 · 7,155 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Genetic Algorithm Based on Adaptive Repair Operator for Solving the Knapsack ProblemSunanda Gupta, M. L. GargProblem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which employed adaptive repair function named as repair and elitism … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 7,713 accessesView PDFCite
Research ArticleOpen accessIn the abstractSystem Evolving using Ant Colony Optimization AlgorithmNada M.A. AL-SalamiProblem statement: The goal of automatic programming system is to create, in an automated way, a computer program that enables a computer to solve a problem. It is difficult to build an automatic programming system: They require carefully designed specification languages and an intimate knowledge base. Determine the relevance of mathematical system theory to the problems of automatic programming and … …Journal of Computer Science, Vol. 5, Issue 5 · 30 May 2009 · 7,516 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Both a Probabilistic Evolutionary Graph and the Evidence Theory for Color Scene AnalysisNassim Ammour, Abderrezak Guessoum, Daoud BerkaniIn this research, we introduce a new color images segmentation algorithm. The color scene analytic method is based on the progress of a probabilistic evolutionary graph. The strategy consists in making grow an evolutionary graph, which presents the scene elements in an unsupervised segmented image. The graph evolution development is based on the computation of the belonging probabilities to the … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 7,013 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Survey of Protein Fold Recognition AlgorithmsMohammed Said Abual-Rub, Rosni AbdullahProblem statement: Predicting the tertiary structure of proteins from their linear sequence is really a big challenge in biology. This challenge is related to the fact that the traditional computational methods are not powerful enough to search for the correct structure in the huge conformational space. This inadequate capability of the computational methods, however, is a major obstacle in facing … …Journal of Computer Science, Vol. 4, Issue 9 · 30 Sep 2008 · 6,877 accessesView PDFCite
Research ArticleOpen accessIn the abstractArchitectural Review of Load Balancing Single System ImageB. S. Ahmed, K. Samsudin, A. R. RamliProblem statement: With the growing popularity of clustering application combined with apparent usability, the single system image is in the limelight and actively studied as an alternative solution for computational intensive applications as well as the platform for next evolutionary grid computing era. Approach: Existing researches in this field concentrated on various features of Single System Images like file system … …Journal of Computer Science, Vol. 4, Issue 9 · 30 Sep 2008 · 8,628 accessesView PDFCite
Research ArticleOpen accessIn the abstractNon-dominated Sorting Genetic Algorithms for Heterogeneous Embedded System DesignA. K. Rath, S. N. DehuriThe design of complex embedded systems involves the simultaneous optimization of several conflicting and competing objectives. Instead of a single global optimal solution, there exist a set of Pareto optimal solutions. In this study we have used a multi-objective evolutionary optimization algorithms called non-dominated sorting genetic algorithm (NSGA), which will suit to the requirements of designing a complex heterogeneous embedded … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,693 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficient Maintenance Scheduler for Near Optimum Utilization of Oil TanksFawaz S. Al-Anzi, Khaled Al-ZamelDue to the entry of Kuwait into WTO and the expected liberalization of petroleum management, the oil market is to become more competitive. However, the space limitation and public increasing awareness of environmental protection issues and stricter regulation passed by Environmental Public Authority (EPA) in Kuwait make the need for full utilization of oil tanks a prime requirement of a … …American Journal of Environmental Sciences, Vol. 1, Issue 4 · 31 Dec 2005 · 6,515 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplication of Harmony Search to Vehicle RoutingZong Woo Geem, Kang Seok Lee, Yongjin ParkA phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus … …American Journal of Applied Sciences, Vol. 2, Issue 12 · 31 Dec 2005 · 12,460 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplying Evolutionary Computing in Case Retrieval StageNabila Nouaouria-Amri, Med Tayeb LaskriCase Based Reasoning is a problem solving paradigm which is able to retrieve and reuse solutions that have worked for similar situations in the past. Past situations and their solutions are stored in a memory called case base. To find the good experiment in memory is the key of success in the reasoning. To identify adequate experiment in memory constitutes … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,738 accessesView PDFCite