Weextend an hypergraph representation, introducedby Finkelstein and Roytberg, to unify dynamic programming algorithms in the context of RNA folding with pseudoknots. Classic applications of RNA dynamic programming (Energy minimization, partition function, base-pair probabilities. . . ) are reformulated within this framework, giving rise to very simple algorithms. This reformulation allows one t...

This paper presents the SCOOPP (SCalable Object Oriented Parallel Programming) approach to support the design and execution of scalable parallel applications. The SCOOPP programming model aims the portability, dynamic scalability and efficiency of parallel applications. The SCOOPP is an hybrid compile and run-time system, which can perform parallelism extraction, supports explicit parallelism a...

So, have the dynamic programming's day arrived or not? From Burt's comprehensive review, one may possibly draw both answers: yes and no. The positive response is only logical given the list of applications in his paper for the last 20 years or so, which is by no means a complete one. Burt's useful suggestions of how to apply dynamic programming in the multi-dimensional state variable problems i...

Dynamic programming is usually regarded as a design technique, where each application is designed as an individual program. This contrasts with other techniques such as linear programming, where there exists a single generic program that solves all instances. From a software engineering perspective, the lack of a generic solution to dynamic programming is somewhat unsatisfactory. It would be mu...

this study develops a long run optimal pattern for nomadic ranchers of fars province under climate uncertainty by simulating dynamic process of livestock and forage productivity as well as employing dynamic stochastic programming. results indicate that the nomadic representatives do not perform, optimally. despite their attachments to livestock as an asset, and their life dependency on livestoc...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

Many applications in biomedical imaging have a demand on automatic detection of lines, contours, or boundaries of bones, organs, vessels, and cells. Aim is to support expert decisions in interactive applications or to include it as part of a processing pipeline for automatic image analysis. Biomedical images often suffer from noisy data and fuzzy edges. Therefore, there is a need for robust met...

nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...