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

100 results for “genetic algorithm method”
Set a search alert
Research ArticleOpen accessAll words, across the recordA Heuristic Moving Vehicle Location Prediction Technique Via Optimal Paths Selection with Aid of Genetic Algorithm and Feed Forward Back Propagation Neural NetworkE. Baby Anitha, K. DuraiswamyThe moving object or vehicle location prediction based on their spatial and temporal information is an important task in many applications. Different methods were utilized for performing the vehicle movement detection and prediction process. In such works, there is a lack of analysis in predicting the vehicles location in current as well as in future. Moreover, such methods compute the … …Journal of Computer Science, Vol. 8, Issue 12 · 12 Dec 2012 · 8,888 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEnvironmental Modeling for Traffic Noise in Urban AreaFrancis Cirianni, Giovanni LeonardiTraffic noise can be classified among the worst factors in terms of damage to people’s health and well-being. The trend of noise pollution modeling variable from the smart result of classic regressive models in the performance of many assessment models based on mathematical expressions, genetic algorithms and neural networks (of GRNN type, General Regression Neural Network). A methodological approach for … …American Journal of Environmental Sciences, Vol. 8, Issue 4 · 18 Jun 2012 · 7,438 accessesView PDFCite
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 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 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 PDFCite
Research ArticleOpen accessAll words, across the recordA Novel Method for Optimal Location and Expansion of Subtransmission Substations Considering Existing Medium-Voltage Distribution FeedersM. Farrokhifar, M. Bana Sharifian, R. EsmaeilzadehThis research presents an accurate comprehensive cost function for the problem of optimal location of subtransmission substations. Technical constraints and economical parameters are investigated in the modeling. Genetic algorithm is used to optimize the cost function. Coding of decision variables is done in a way that finding the correct solutions is achieved faster. For the first time in this study, … …American Journal of Applied Sciences, Vol. 6, Issue 3 · 31 Mar 2009 · 7,788 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordHybrid Optimize Strategy based QoS Route Algorithm for Mobile Ad hoc NetworksFu Peng, Zhang DeyunIt is very difficult to find feasible QoS (Quality of service) routes in the mobile ad hoc networks (MANETs), because of the nature constrains of it, such as dynamic network topology, wireless communication link and limited process capability of nodes. In order to reduce average cost in flooding path discovery scheme of the traditional MANETs routing protocols and increase the … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 6,546 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordExperimental 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 recordComparison of Pre-Processing and Classification Techniques for Single-Trial and Multi-Trial P300-Based Brain Computer InterfacesChanan S. Syan, Randy E.S. HarnarinesinghThe P300 component of Event Related Brain Potentials (ERP) is commonly used in Brain Computer Interfaces (BCI) to translate the intentions of an individual into commands for external devices. The P300 response, however, resides in a signal environment of high background noise. Consequently, the main problem in developing a P300-based BCI lies in identifying the P300 response in the presence … …American Journal of Applied Sciences, Vol. 7, Issue 9 · 30 Sep 2010 · 7,570 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordUsing Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment AlgorithmsEvandro A. Marucci, Geraldo F.D. Zafalon, Julio C. Momente et al.Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is … …Current Research in Bioinformatics, Vol. 1, Issue 1 · 8 Mar 2012 · 14,192 accessesView PDFCite