105 results for “genetic algorithms”

Set a search alert

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 PDF Cite

Research ArticleOpen accessAll words, across the recordUsing Hyper Clustering Algorithms in Mobile Network PlanningLamiaa Fattouh Ibrahim, Hesham A. SalmanProblem statement: As a large amount of data stored in spatial databases, people may like to find groups of data which share similar features. Thus cluster analysis becomes an important area of research in data mining. Applications of clustering analysis have been utilized in many fields, such as when we search to construct a cluster served by base station in … …American Journal of Applied Sciences, Vol. 8, Issue 10 · 30 Aug 2011 · 7,504 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordAn Independent Rough Set Approach Hybrid with Artificial Bee Colony Algorithm for Dimensionality ReductionNambiraj Suguna, Keppana Gowder ThanushkodiProblem statement: Dimensionality reduction is viewed as an important pre-processing step for pattern recognition and data mining. As the classical rough set model considers the entire attribute set as a whole to find the subset, comparing all possible combinations of sets of attributes is difficult. Approach: In this study, we have introduced an improved Rough Set-based Attribute Reduction (RSAR) namely … …American Journal of Applied Sciences, Vol. 8, Issue 3 · 25 Mar 2011 · 8,334 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordEvolutionary Algorithm DefinitionNada M.A. AL-SalamiProblem statement: Most resent evolutionary algorithms work under weak theoretical basis and thus, they are computationally expensive. Approach: This study discussed the use of new evolutionary algorithm for automatic programming, based on theoretical definitions of program behaviors. Evolutionary process adapted fixed and self-organized input-output specification of the problem, to evolve good finite state machine that efficiently satisfies these specifications. Results: … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 10 Dec 2009 · 7,751 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordDiscretization Numerical Data for Relational Data with One-to-Many RelationsRayner AlfredProblem statement: Handling numerical data stored in a relational database has been performed differently from handling those numerical data stored in a single table due to the multiple occurrences (one-to-many association) of an individual record in the non-target table and non-determinate relations between tables. Numbers in Multi-Relational Data Mining (MRDM) were often discretized, after considering the schema of the relational … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 7,030 accessesView PDF Cite