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

44 results for “Heuristic method”
Set a search alert
Research ArticleOpen accessIn the abstractOn the Predictability of Risk Box Approach by Genetic Programming Method for Bankruptcy PredictionAlireza Bahiraie, Noor Akma bt Ibrahim, A. K.M. AzharProblem statement: Theoretical based data representation is an important tool for model selection and interpretations in bankruptcy analysis since the numerical representation are much less transparent. Some methodological problems concerning financial ratios such as non-proportionality, non-asymetricity, non-scalicity are solved in this study and we presented a complementary technique for empirical analysis of financial ratios and bankruptcy risk. Approach: This study … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 7,948 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 accessesView PDFCite
Research ArticleOpen accessIn the abstractInclusion Identification by Inverse Application of Boundary Element Method, Genetic Algorithm and Conjugate Gradient MethodMahmud Khodadad, Mohsen Dashti ArdakaniCharacterization of the interior of an inhomogeneous body using displacement measurements obtained by conducting a simple tension test was investigated. A homogeneous elastic solid body is assumed to have another solid body with arbitrary shape hidden inside it. The shape and physical properties of this inclusion were unknown. The Boundary Element Method (BEM) coupled with a mete heuristic Genetic Algorithm … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 6,758 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 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 accessIn the abstractAn Iterative Method for Algorithms Implementation on a Limited Dynamically Reconfigurable HardwareAbdellatif Mtibaa, Abdessalem B. Abdelali, Lotfi Boussaid, Elbey BourennaneIn this study we propose a framework and a combined temporal partitioning and design space exploration method for run time reconfigurable processors. Our objective is to help designers to implement an algorithm in limited FPGA area resources while respecting the execution time constraint. The algorithm to be implemented is represented by a task graph with different implementation alternatives (design points) … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,536 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid 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 accessIn the abstractDistributed and Parallel Decision Forest for Human Activities Prediction: Experimental Analysis on HAR-Smartphones DatasetBudi Padmaja, Venkata Rama Prasad Vaddella, Kota Venkata Naga SunithaSensor-based human motion detection requires the subtle amount of knowledge about various human activities from fitted sensor observations and readings. The prevalent pattern recognition methodologies have made immense progress over recent years. Nonetheless, these kind of methods usually rely on the particular heuristic variable extraction, which could inhibit generalization realization. This paper presents a distributed and parallel decision forest approach … …Journal of Computer Science, Vol. 15, Issue 5 · 11 May 2019 · 7,392 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Constraint-Handling Technique for Genetic Algorithms using a Violation FactorAdam Chehouri, Rafic Younes, Jean Perron, Adrian IlincaOver the years, several meta-heuristic algorithms were proposed and are now emerging as common methods for constrained optimization problems. Among them, genetic algorithms (GA’s) shine as popular evolutionary algorithms (EA’s) in engineering optimization. Most engineering design problems are difficult to resolve with conventional optimization algorithms because they are highly nonlinear and contain constraints. In order to handle these constraints, the … …Journal of Computer Science, Vol. 12, Issue 7 · 31 Aug 2016 · 8,751 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Layout Based Detachment Approach for Extracting Content from WebpagesDeepa Chandran, Anna Saro VijendranEnormous amount of useful information presented in Internet is usually formatted for the web users. But it is a really complex task to extract the relevant data from various web sources. Recently, various approaches for the extraction of data from the webpages were proposed. This study provides a simple but effective approach, named Layout Based Detachment Approach (LBDA). The proposed … …American Journal of Applied Sciences, Vol. 12, Issue 6 · 25 Jul 2015 · 6,345 accessesView PDFCite