Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

104 articles for “genetic algorithms”
Set a search alert
Also matching:1 special issue
Research ArticleOpen accessIn the abstractOPTIMAL RESOURCE ALLOCATION FOR LAYERED VIDEO MULTICASTING IN WIMAXHung-Yi Teng, Chun-Hung Wu, Ren-Hung HwangReal-time video disseminations over wireless links such as video telephony, video conferencing and mobile TV have become fast growing applications. In order to cope with the increasing users' demand, a new scalable and efficient wireless distribution platform is needed. With numerous advantages such as QoS assurance, high data rate and wide coverage, WiMAX has been regarded as an ideal choice … …Journal of Computer Science, Vol. 10, Issue 12 · 24 Dec 2014 · 7,410 accessesView PDFCite
Research ArticleOpen accessIn the abstractSIMULATED ANNEALING APPROACH TO COST-BASED MULTI- QUALITY OF SERVICE JOB SCHEDULING IN CLOUD COMPUTING ENVIROMENTMonir Abdullah, Mohamed OthmanCloud computing environments facilitate applications by providing visualized resources that can be provisioned dynamically. The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling … …American Journal of Applied Sciences, Vol. 11, Issue 6 · 18 Mar 2014 · 7,651 accessesView PDFCite
Research ArticleOpen accessIn the abstractDEVELOPMENT OF A FUZZY-SIMULATION MODEL OF SCHEDULING ROBOTIC FLEXIBLE ASSEMBLY CELLSKhalid Abd, Kazem Abhary, Romeo MarianDue to the complexity of scheduling flexible manufacturing systems, the generation of production schedules requires an intelligent technique. Many artificial intelligence techniques such as fuzzy logic, genetic algorithms and neural networks have been successfully applied to the scheduling of advanced manufacturing systems. One such system is Robotic Flexible Assembly Cells (RFACs). Few studies have addressed the problem of scheduling RFACs. … …Journal of Computer Science, Vol. 9, Issue 12 · 25 Nov 2013 · 6,791 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid of Fuzzy Clustering Neural Network Over NSL Dataset for Intrusion Detection SystemDahlia Asyiqin Ahmad Zainaddin, Zurina Mohd HanapiIntrusion Detection System (IDS) is one of the component that take part in the system defence, to identify abnormal activities happening in the computer system. Nowadays, IDS facing composite demands to defeat modern attack activities from damaging the computer systems. Anomaly-Based IDS examines ongoing traffic, activity, transactions and behavior in order to identify intrusions by detecting anomalies. These technique identifies … …Journal of Computer Science, Vol. 9, Issue 3 · 4 May 2013 · 6,574 accessesView PDFCite
Research ArticleOpen accessIn the abstractSoft Computing in Optimizing Assembly Lines BalancingMuhammad Zaini Matondang, Muhammad Ikhwan JambakAs part of manufacturing systems, the assembly line has become one of the most valuable researches to accomplish the real world problems related to them. Many efforts have been made to seek the best techniques in optimizing assembly lines. Problem statement: Since it was published by Salveson in 1955, some methods and techniques have been developed based on mathematical modeling. … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,469 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation ProblemKhalid A. EldrandalyProblem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization) problems. Approach: … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,849 accessesView PDFCite
Research ArticleOpen accessIn the abstractExperimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing ProblemZoheir EzzianeThis research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,716 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA Challenge for Routing Algorithms in Optical Multistage Interconnection NetworksMehrnaz Moudi, Mohamed OthmanProblem statement: A class of dynamic interconnection networks is Multistage Interconnection Networks (MINs) that connects input devices to output devices through a number of switch stages. MINs have assumed importance in recent years; because of their cost-effectiveness. Optical MINs are one type of MINs that have large transmission capacity in the communication networks. There is a major problem in Optical … …Journal of Computer Science, Vol. 7, Issue 11 · 29 Aug 2011 · 7,852 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,617 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordStrength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer NetworksSubbaraj Potti, Chitra ChinnasamyProblem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA), is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing … …Journal of Computer Science, Vol. 7, Issue 1 · 16 Dec 2010 · 8,216 accessesView PDFCite