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

29 results for “Approximate Solution”
Set a search alert
Research ArticleOpen accessIn the abstractOn Sixtic Lacunary Spline Solutions of Second Order Initial Value ProblemJwamer Karwan Hama FarajProblem statement: The lacunary problem, which we had investigated in this study, consider in finding the spline function of degree six S(x) of deficiency four, interpolating data given on the function value and third, forth order in the interval [0,1]. Also, on the extra initial condition was prescribed on the first derivative. Other purpose of this construction was to solve … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,763 accessesView PDFCite
Research ArticleOpen accessIn the abstractGenome Sequence Analysis: A SurveyHassan Mathkour, Muneer AhmadProblem statement: Sequence analysis problems are NP hard and need optimal solutions. Interesting problems include duplicate sequence detection, sequence matching by relevance, sequence analysis using approximate comparison in general or using tools i.e., Matlab and multi-lingual sequence analysis. The usefulness of these operations is highlighted and future expectations are described. Approach: This study described the concepts, tools, methodologies, algorithms being … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,830 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn the Pseudo-Spectral Method of Solving Linear Ordinary Differential EquationsB. S. OgundareProblem statement: Not all differential equations can be solved analytically, to overcome this problem, there is need to search for an accurate approximate solution. Approach: The objective of this study was to find an accurate approximation technique (scheme) for solving linear differential equations. By exploiting the Trigonometric identity property of the Chebyshev polynomial, we developed a numerical scheme referred to … …Journal of Mathematics and Statistics, Vol. 5, Issue 2 · 30 Jun 2009 · 7,222 accessesView PDFCite
Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Order Six Zero-Stable Method for Direct Solution of Fourth Order Ordinary Differential EquationsKayode Sunday JacobA zero-stable numerical method for direct solution of fourth order differential equations reduces the computational burden and computer time wastage involved in the method of reducing such equations to a system of first order equations. The method adopted is the collocation of the differential system and the interpolation of the approximate solution to the problem using the power series as … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,170 accessesView PDFCite
Research ArticleOpen accessIn the abstractNonlinear Whitham-Broer-Kaup Wave Equation in an Analytical SolutionS.A. Zahedi, M. Vaezi, N. TolouThis study presented a new approach for the analysis of a nonlinear Whitham-Broer-Kaup equation dealing with propagation of shallow water waves with different dispersion relations. The analysis was based on a kind of analytical method, called Variational Iteration Method (VIM). To illustrate the capability of the approach, some numerical examples were given and the propagation and the error of solutions … …American Journal of Engineering and Applied Sciences, Vol. 1, Issue 2 · 30 Jun 2008 · 7,680 accessesView PDFCite
Research ArticleOpen accessIn the abstractDETECTING MULTIPLE INTRUSION ATTACKS USING PERMANENT GIRTH CLUSTERING MODEL IN WIRELESS SENSOR NETWORKG. Jayamurugan, P. KamalakkannanSecurity is the central challenge and one of the serious concerns for designing reliable sensor networks. Of the different types of security threats in wireless sensor network, particularly dangerous attack is the replica node attack, in which the opponent takes the secret keying materials from a compromised node. It then produces large number of attacker-controlled replicas that divide up the … …Journal of Computer Science, Vol. 10, Issue 8 · 1 Apr 2014 · 6,467 accessesView PDFCite
Research ArticleOpen accessIn the abstractAN EFFICIENT HYBRID ALGORITHM TO REDUCE LATENCY IN AD-HOC AGGREGATIONN. Rajkumar, N. K. Senthil Kumar, P. Subha, R. KavithaA data warehouse is a collection of data gathered and organized so that it can easily be analyzed, extracted, synthesized and also be used for the purpose of further understanding data. Peer to Peer networks are used for distribution and sharing of documents. In traditional techniques, when aggregate functions like average, sum and count are encountered, the aggregate operation is … …Journal of Computer Science, Vol. 10, Issue 7 · 18 Feb 2014 · 6,908 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Genetic Algorithm Based Multi Objective Service Restoration in Distribution SystemsSathish Kumar Kannaiah, Jayabarathi Thangavel, D. P. KothariProblem statement: A Genetic Algorithm (GA) used here to find exact or approximate solutions to optimization and search problems. Genetic algorithms are a particular class of evolutionary algorithms that use techniques inspired by evolutionary biology such as inheritance, mutation, selection and crossover. Approach: GA is a method for search and optimization based on the process of natural selection and evolution. … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 7,029 accessesView PDFCite