Interpreters have a bad reputation for having lower performance than just-in-time compilers. We present a new way of building high performance interpreters that is particularly effective for executing dynamically typed programming languages. The key idea is to combine speculative staging of optimized interpreter instructions with a novel technique of incrementally and iteratively concerting the...

Cellular Manufacturing is a successful application of Group Technology concepts: we want to group parts into families having similar characteristics and identify dedicated set of machines (cells) to process the different families while minimizing the number of parts that need to be processed by machines placed in different cells (Inter-Cell Flow). The proposed approach consists on iteratively r...

A particular Markov chain Monte Carlo algorithmis constructed to allow Bayesian inference in a hidden Markov model used in hematology. The algorithm has an outer Gibbsian structure, and incorporates both Metropolis and Hastings updates to move through the space of possible hidden states. While somewhat sophisticated, this algorithm still has problems getting around the infinite-dimensional spac...

Run-to-run optimization methodologies exploit the repetitive nature of batch processes to find the optimal operating policy in the presence of uncertainty. For the class of batch optimization problems where the solution is determined by terminal constraints, the update of the decision variables towards their optimal values is realized using a constraint control scheme. The methodology is adapte...

The nonconvex and nonsmooth optimization problem has been attracting increasing attention in recent years image processing machine learning research. algorithm-based reweighted step widely used many applications. In this paper, we propose a new, extended version of the iterative convex majorization–minimization method (ICMM) for solving minimization problem, which involves famous methods. To pr...

Abstract In this paper we propose a new algorithm for solving class of nonsmooth nonconvex problems, which is obtained by combining the iteratively reweighted scheme with finite number forward–backward iterations based on linesearch procedure. The method overcomes some limitations methods, since it can be applied also to minimize functions containing terms that are both and nonconvex. Moreover,...