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

235 results for “Programming I”
Set a search alert
Research ArticleOpen accessIn the keywordsComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber ProblemsChansiri Singhtaun, Peerayuth CharnsethikulProblem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distance between the facilities … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,529 accessesView PDFCite
Research ArticleOpen accessIn the keywordsStochastic Optimization for Portfolio Selection Problem with Mean Absolute Negative Deviation MeasureAnton Abdulbasah Kamil, Adli Mustafa, Khlipah IbrahimProblem statement: The most important character within optimization problem is the uncertainty of the future returns. Approach: To handle such problems, we utilized probabilistic methods alongside with optimization techniques. We developed single stage and two stage stochastic programming with recourse. The models were developed for risk adverse investors and the objective of the stochastic programming models is to minimize the … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 6,950 accessesView PDFCite
Research ArticleOpen accessIn the keywordsInvestigation the Substitution Capability of Oilseeds in Cropping PatternMahmoud Daneshvar Kakhki, S. Youssefzade, Hamideh Ghodrati AzadiProblem statement: Farm activity is a risky activity special in less developed countries, so all decisions and activities are affected by this phenomenon. Consideration of risk either helps to elimination of deviations in result of model or preparing tools for evolution of some policies that the aim of them is reducing the risk for farmers. Oil seed are the second … …American Journal of Applied Sciences, Vol. 6, Issue 12 · 31 Dec 2009 · 7,182 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Determination of Optimal Crop Pattern with Aim of Reduction in Hazards of EnvironmentalMahmoud Daneshvar Kakhki, Nasser Sahnoushi, F. Salehi Reza AbadiProblem statement: The purpose of the study was to find the optimal cropping pattern, in Taybad, which maximizes the net return per water cubic meter and per fertilizer kilogram. Approach: A linear programming model and a fuzzy multi-objective fractional programming model were applied and then these models were compared. Results: Result of study showed ratio of net return into consumption … …American Journal of Agricultural and Biological Sciences, Vol. 4, Issue 4 · 31 Dec 2009 · 8,285 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEvolutionary Algorithm DefinitionNada M.A. AL-SalamiProblem statement: Most resent evolutionary algorithms work under weak theoretical basis and thus, they are computationally expensive. Approach: This study discussed the use of new evolutionary algorithm for automatic programming, based on theoretical definitions of program behaviors. Evolutionary process adapted fixed and self-organized input-output specification of the problem, to evolve good finite state machine that efficiently satisfies these specifications. Results: … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 10 Dec 2009 · 7,761 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Survey of Compute Intensive Algorithms for Ribo Nucleic Acids Structural DetectionRa’ed Al-Khatib, Rosni Abdullah, Nur’Aini Abdul RashidProblem statement: Finding an accurate RNA structural alignment from primary sequence due to it is time consuming and computationally NP-hard problem is a major bioinformatics challenge. According to our investigation majority of current researches were concerned on achieving faster execution time, improving space complexity and better cache management. Recently one research introduced cache-efficient Chip Multiprocessor (CMP) algorithms with good speed-up … …Journal of Computer Science, Vol. 5, Issue 10 · 31 Oct 2009 · 6,463 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMemory TracingEva Cogan, Chaya GurwitzProblem statement: Students completing introductory computing courses did not know how to program at the expected level. Seeking the underlying problem, we came to believe that students were focusing only on results and not connecting with the inner workings of their code. This left them poorly prepared to master increasingly complex problems. Approach: We hoped that by promoting memory tracing … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 7,163 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSystem 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,522 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOptimization of Test Scheduling and Test Access for ITC-02 SOC Benchmark CircuitsP. Sakthivel, R. Delhi Babu, P. NarayanasamyProblem statement: This study presented the optimized test scheduling and test access for ITC-02 SOC benchmark circuits using genetic algorithm. In the scheduling procedure of SOC, scheduling problem was formulated as a sequence of two problems and solved. Approach: Test access mechanism width was partitioned into two and three partitions and the applications of test vectors and test vector assignments … …Journal of Computer Science, Vol. 5, Issue 4 · 30 Apr 2009 · 7,319 accessesView PDFCite
Research ArticleOpen accessIn the keywordsBenders' 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,684 accessesView PDFCite