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

53 results for “solving optimization”
Set a search alert
Research ArticleOpen accessIn the abstractMemoryless Modified Symmetric Rank-One Method for Large-Scale Unconstrained OptimizationFarzin Modarres, Malik Abu Hassan, Wah June LeongProblem statement: Memoryless QN methods have been regarded effective techniques for solving large-scale problems that can be considered as one step limited memory QN methods. In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. Approach: The basic idea is to apply … …American Journal of Applied Sciences, Vol. 6, Issue 12 · 31 Dec 2009 · 7,981 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimal Power Multicast Problem in Wireless Mesh Networks by Using a Hybrid Particle Swarm OptimizationAllam Maalla, Chen Wei, Haitham J. TahaProblem statement: Most mobile nodes in a wireless ad hoc network are powered by energy limited batteries; the limited battery lifetime imposes a constraint on the network performance. Therefore, power consumption of network operations is critical and subject to optimization. Approach: A novel hybrid PSO was proposed for solving the minimum power multicast problem in wireless ad-hoc networks. The MPM … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 6,809 accessesView PDFCite
Research ArticleOpen accessIn the abstractTwo-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained OptimizationAbbas Y. AL-Bayati, A.J. Salim, Khalel K. AbboProblem statement: (CG) algorithms, which we had investigated in this study, were widely used in optimization, especially for large scale optimization problems, because it did not need the storage of any matrix. The purpose of this construction was to find new CG-algorithms suitable for solving large scale optimization problems. Approach: Based on pure conjugacy condition and quadratic convex function two … …American Journal of Economics and Business Administration, Vol. 1, Issue 2 · 30 Jun 2009 · 8,108 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation ProblemKhalid A. EldrandalyProblem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization) problems. Approach: … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,849 accessesView PDFCite
Research ArticleOpen accessIn the abstractSystem Evolving using Ant Colony Optimization AlgorithmNada M.A. AL-SalamiProblem statement: The goal of automatic programming system is to create, in an automated way, a computer program that enables a computer to solve a problem. It is difficult to build an automatic programming system: They require carefully designed specification languages and an intimate knowledge base. Determine the relevance of mathematical system theory to the problems of automatic programming and … …Journal of Computer Science, Vol. 5, Issue 5 · 30 May 2009 · 7,516 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplying Simulated Annealing For Optimal Operation of Multi-Reservoir SystemsF. Khodabakhshi, A. R. Ghirian, N. KhakzadThe need to optimize the operation of water reservoirs is an issue that is becoming increasingly a concern for water resources planners in developing countries. This issue particularly becomes more significant in large systems with multiple reservoirs where operation of one reservoir has an impact on the others. In other word, the set of reservoirs in these systems act like … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 1 · 31 Mar 2009 · 7,620 accessesView PDFCite
Research ArticleOpen accessIn the abstractRule Extraction from Radial Basis Functional Neural Networks by Using Particle Swarm OptimizationM. R. Senapati, I. Vijaya, P. K. DashRadial basis functional neural networks (RBFNN) provide an outstanding possibility for generating rules for solving pattern classification problems. One of the most important factors in RBFNN is finding out the center and spread. This paper examines rules extracted from RBF networks trained by Particle swarm Optimization (PSO). The selection of the RBFNN centers, spreads and the network weights can be … …Journal of Computer Science, Vol. 3, Issue 8 · 31 Aug 2007 · 6,784 accessesView PDFCite
Literature ReviewOpen accessIn the abstractA Review on Heuristics for Addition Chain Problem: Towards Efficient Public Key CryptosystemsAdamu Muhammad Noma, Abdullah Muhammed, Mohamad Afendee Mohamed, Zuriati Ahmad ZulkarnainField exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, we survey from the onset of the addition chain problem to the state-of-the-art heuristics for optimizing … …Journal of Computer Science, Vol. 13, Issue 8 · 1 Jun 2017 · 8,163 accessesView PDFCite
Research ArticleOpen accessIn the abstractAsymptotic Properties of Local Sampling on ManifoldYury Aleksandrovich YanovichIn many applications, the real high-dimensional data occupy only a very small part in the high dimensional ‘observation space’ whose intrinsic dimension is small. The most popular model of such data is Manifold model which assumes that the data lie on or near an unknown manifold Data Manifold, (DM) of lower dimensionality embedded in an ambient high-dimensional input space (Manifold … …Journal of Mathematics and Statistics, Vol. 12, Issue 3 · 26 Aug 2016 · 7,698 accessesView PDFCite
EditorialOpen accessIn the abstractUse of Design of Experiments and Manuscripts Rejection RateAydin Berenjian, Jason RyanTraditional one-variable-at-a-time method was and still is for some researchers, the general procedure to determine the optimal conditions for a chemical, biochemical or biological mechanism. According to this technique, a large number of experiments should be performed to obtain a high precision in effect assessment and also the interaction among the variables cannot be defined. To overcome the limitations of … …American Journal of Biochemistry and Biotechnology, Vol. 11, Issue 2 · 8 Jun 2015 · 7,167 accessesView PDFCite