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

147 results for “solving problems”
Set a search alert
Research ArticleOpen accessEvery word in the titleThe Best Candidates Method for Solving Optimization ProblemsHlayel Abdallah AhmadProblem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 8,341 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleThe Role of Molam in Solving Social ProblemsSitthisak ChampadaengProblem statement: Mo-lam is the most popular Isan Local Song. Its rhythm and message influenced people’s feeling and thought. The objectives of this research were to study: (1) the moving force in using the media of Mo-lam for solving social problem, (2) the role of Mo-lam and social problem solving and (3) the effect of campaign with the sharing in … …Journal of Social Sciences, Vol. 6, Issue 3 · 30 Sep 2010 · 7,973 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleFitted Reproducing Kernel Method for Solving a Class of Third-Order Periodic Boundary Value ProblemsAsad Freihat, Radwan Abu-Gdairi, Hammad Khalil et al.In this article, the reproducing kernel Hilbert space W24 [0, 1] is employed for solving a class of third-order periodic boundary value problem by using fitted reproducing kernel algorithm. The reproducing kernel function is built to get fast accurately and efficiently series solutions with easily computable coefficients throughout evolution the algorithm under constraint periodic conditions within required grid points. The … …American Journal of Applied Sciences, Vol. 13, Issue 5 · 11 May 2016 · 7,647 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSolving Directly Two Point Non Linear Boundary Value Problems Using Direct Adams Moulton MethodZanariah Abdul Majid, Phang Pei See, Mohamed SuleimanProblem statement: In this study, a direct method of Adams Moulton type was developed for solving non linear two point Boundary Value Problems (BVPs) directly. Most of the existence researches involving BVPs will reduced the problem to a system of first order Ordinary Differential Equations (ODEs). This approach is very well established but it obviously will enlarge the systems of … …Journal of Mathematics and Statistics, Vol. 7, Issue 2 · 18 May 2011 · 7,882 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew Scaled Sufficient Descent Conjugate Gradient Algorithm for Solving Unconstraint Optimization ProblemsAbbas Y. AL-Bayati, Rafiq S. MuhammadProblem statement: The scaled hybrid Conjugate Gradient (CG) algorithm which usually used for solving non-linear functions was presented and was compared with two standard well-Known NAG routines, yielding a new fast comparable algorithm. Approach: We proposed, a new hybrid technique based on the combination of two well-known scaled (CG) formulas for the quadratic model in unconstrained optimization using exact line … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,046 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAnt Colony Optimization for Solving Solid Waste Collection Scheduling ProblemsZ. Ismail, S. L. LohProblem statement: Southern Waste Management environment (SWM environment) is a company responsible for the collection and disposal of solid waste for the city of Johor Bahru, a city with over one million populations. The company is implementing an integrated solid waste management system where it involved in the optimization of resources to ensure the effectiveness of its services. Formulating this … …Journal of Mathematics and Statistics, Vol. 5, Issue 3 · 30 Sep 2009 · 8,015 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleThe Existence, Uniqueness and Error Bounds of Approximation Splines Interpolation for Solving Second-Order Initial Value ProblemsAbbas Y. Al Bayati, Rostam K. Saeed, Faraidun K. Hama-SalhProblem statement: The lacunary interpolation problem, which we had investigated in this study, consisted in finding the six degree spline S(x) of deficiency four, interpolating data given on the function value and third and fifth order in the interval [0,1]. Also, an extra initial condition was prescribed on the first derivative. Other purpose of this construction was to solve the … …Journal of Mathematics and Statistics, Vol. 5, Issue 2 · 30 Jun 2009 · 8,172 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParameter Settings for New Generational Genetic Algorithms for Solving Global Optimization ProblemsSiew Mooi Lim, Md. Nasir Sulaiman, Norwati Mustapha, Abu Bakar Md. SultanThis study operates within experimental design with two main tools of Taguchi method namely orthogonal array and signal to noise ratio to discover the optimal parameter settings for newly proposed generational genetic algorithms; they are Laplace Crossover-Scale Truncated Pareto Mutation (LX-STPM) and Rayleigh Crossover-Scale Truncated Pareto Mutation (RX-STPM). It concluded that GA parameter settings are algorithms and problems dependent. …Journal of Computer Science, Vol. 11, Issue 11 · 7 Jan 2016 · 6,404 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAn Improved Clustering Based Genetic Algorithm for Solving Complex NP ProblemsR. Sivaraj, T. RavichandranProblem statement: The selection process is a major factor in genetic algorithm which determines the optimality of solution for a complex problem. The selection pressure is the critical step which finds out the best individuals in the entire population for further genetic operators. The proposed algorithm tries to find out the best individuals with reduced selection pressure than standard genetic … …Journal of Computer Science, Vol. 7, Issue 7 · 28 Jun 2011 · 6,928 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSolving Linear Programming Problems on the Parallel Virtual Machine EnvironmentJrJung Lyu, Hsing Luh, Ming-Chang LeeThis study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the well-known method, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also provided in order to verify the complexity … …American Journal of Applied Sciences, Vol. 1, Issue 2 · 30 Jun 2004 · 7,837 accessesView PDFCite