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

31 articles for “dynamic programming”
Set a search alert
Research ArticleOpen accessPhrase in the titleSolving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian ProcedureNaif AlajlanProblem statement: To design, implement, and test an algorithm for solving the square jigsaw puzzle problem, which has many applications in image processing, pattern recognition, and computer vision such as restoration of archeological artifacts and image descrambling. Approach: The algorithm used the gray level profiles of border pixels for local matching of the puzzle pieces, which was performed using dynamic … …American Journal of Applied Sciences, Vol. 6, Issue 11 · 30 Nov 2009 · 7,690 accessesView PDFCite
Research ArticleOpen accessPhrase 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
Review ArticleOpen accessIn the keywordsSurvey on Representation Techniques for Malware Detection SystemGamal Abdel Nassir Mohamed, Norafida Bte IthninMalicious programs are malignant software’s designed by hackers or cyber offenders with a harmful intent to disrupt computer operation. In various researches, we found that the balance between designing an accurate architecture that can detect the malware and track several advanced techniques that malware creators apply to get variants of malware are always a difficult line. Hence the study of … …American Journal of Applied Sciences, Vol. 14, Issue 11 · 10 Jul 2017 · 8,582 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMeta Heuristic Algorithms for Vehicle Routing Problem with Stochastic DemandsGeetha Shanmugam, Poonthalir Ganesan, Dr. P.T. VanathiProblem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP) which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 8,021 accessesView PDFCite
Research ArticleOpen accessIn the keywordsTwo Reformulations for the Dynamic Quadratic Assignment ProblemSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both … …Journal of Mathematics and Statistics, Vol. 6, Issue 4 · 31 Dec 2010 · 7,947 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,458 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,681 accessesView PDFCite
Research ArticleOpen accessIn the keywordsHydropower System Management Considering the Minimum OutflowM. L. Arganis, R. DomínguezThis paper deals with the operating rules of the Grijalva River hydropower serial system obtained by means of stochastic dynamic programming and its subsequent simulation using historical records and synthetic series. Penalties in spills and deficit were considered in optimum policies. During simulation several restrictions were added to the original problem, particularly to ensure minimum outflow so as to guarantee … …American Journal of Environmental Sciences, Vol. 4, Issue 3 · 30 Jun 2008 · 6,540 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDynamic Allocation of CPUs in Multicore Processor for Performance Improvement in Network Security ApplicationsSudhakar Gummadi, Radhakrishnan ShanmugasundaramProblem statement: Multicore and multithreaded CPUs have become the new approach for increase in the performance of the processor based systems. Numerous applications benefit from use of multiple cores. Increasing performance of the system by increasing the number of CPUs of the multicore processor for a given application warrants detailed experimentation. In this study, the results of the experimentation done … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 6,844 accessesView PDFCite
Research ArticleOpen accessIn the keywordsStrength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer NetworksSubbaraj Potti, Chitra ChinnasamyProblem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA), is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing … …Journal of Computer Science, Vol. 7, Issue 1 · 16 Dec 2010 · 8,216 accessesView PDFCite