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

235 results for “Programming”
Set a search alert
Research ArticleOpen accessEvery word in the titleA Graphical Based Method for a Class of One-Stage Bounded Variables and Single Constrained Linear Programming ProblemsSuwitchaporn Witchakul, Prapaisri Sudasna-na-Ayudthya, Peerayuth Charnsethikul, Kamlesh MathurAn efficient and effective special purpose method is proposed for solving a class of one-stage single constrained linear programming problems with a finite number of right hand side scenarios and bounded variables. We compare our proposed method with a general purpose method using CPLEX interactive optimizer. For various m and n, by using elapsed computational time as the criteria, our … …American Journal of Applied Sciences, Vol. 4, Issue 12 · 31 Dec 2007 · 6,919 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew Integer Programming Formulations of the Generalized Travelling Salesman ProblemPetrica C. PopThe Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP), in which the nodes of an undirected graph are partitioned into node sets (clusters) and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart … …American Journal of Applied Sciences, Vol. 4, Issue 11 · 30 Nov 2007 · 7,200 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOptimal Rejuvenation Scheduling of Distributed Computation Based on Dynamic ProgrammingHiroyuki Okamura, Kazuki Iwamoto, Tadashi DohiRecently, a complementary approach to handle transient software failures, called software rejuvenation, is becoming popular as a proactive fault management technique in operational software systems. In this study, we develop the optimal scheduling algorithms to trigger software rejuvenation in distributed computation circumstance. In particular, we focus on two different computation circumstances in terms of detection of failures. Based on the … …Journal of Computer Science, Vol. 2, Issue 6 · 30 Jun 2006 · 6,385 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOn Stability in Multiobjective Integer Linear Programming: A Stochastic ApproachWalied H. Sharif, Omar M. SaadIn this study we consider a multiobjective integer linear stochastic programming problem with individual chance constraints. We assume that there is randomness in the right-hand sides of the constraints only and that the random variables are normally distributed. Some stability notions for such problem are characterized. An auxiliary problem is discussed and an algorithm as well as an illustrative example … …American Journal of Applied Sciences, Vol. 2, Issue 12 · 31 Dec 2005 · 6,707 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExtension to Sufficient Optimality Conditions in Complex ProgrammingE. A. Youness, M. E. ElbrolosyIn this study we extend the sufficient optimality conditions of complex programming problems to a large class of functions that include the two parts (real and imaginary) of the objective function. The sufficient conditions were established under generalized forms of convexity assumptions. The previous results that considered the real part only can be deduced as special cases. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 31 Mar 2005 · 6,242 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOn Quasi E-Convex Bilevel Programming ProblemE. A. Youness, O. M.A. Al-OlaaBilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems. …American Journal of Applied Sciences, Vol. 2, Issue 2 · 28 Feb 2005 · 6,569 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
Research ArticleOpen accessEvery word in the titleA Mixed Integer Linear Programming for Optimising the Residential Solar Energy Storage SystemTeube Cyrille Mbainaissem, Dethie Dione, Bakary Kone, Youssoupha ToureThe global electricity sector is facing a major transition to sustainable energy sources, with consumers playing a crucial role in realising the full potential of the international energy market. Residential energy storage systems are a priority to promote local flexibility and participation in the energy transition. The combination of solar energy generators and storage batteries is a key method of … …Journal of Mathematics and Statistics, Vol. 22, Issue 1 · 16 Jul 2026 · 1,196 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSocial Media-Facilitated Programming: An ARG Model for Collaborative ProgrammingAhmad Al-Jarrah, Abdel Karim Baareh, Ahmad Smadi, Roba JabaliInternet-based tools and social media are greatly developed in the tech world. Today, technology is widely accepted and used by all generations. These tools are great and very useful for students in terms of learning, collaboration and information sharing. We aim to present a model for learning programming in social learning environments with the context of the Affinity Research Group … …Journal of Computer Science, Vol. 17, Issue 4 · 15 Apr 2021 · 7,017 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePerformance Improvement of SNP Search Using Multithread ProgrammingGeraldo Francisco Donegá Zafalon, Álvaro Magri Nogueira da Cruz, Anderson Rici Amorim et al.Pattern recognition is an important field in Bioinformatics and a well-known task is the search for Single Nucleotide Polymorphism (SNP). It is possible to search for a known SNP position and analyze it using patterns of DNA bases, called masks. Nonetheless, this process becomes computationally expensive as the amount of available genomic data increases. Thus, in this study, we have … …Journal of Computer Science, Vol. 14, Issue 11 · 7 Nov 2018 · 7,734 accessesView PDFCite