An important hypothesis of the research reported in this paper is that dynamic space warping (DSW), a dynamic programming (DP) technique (Bellman 1965, Brown 1996), can be effectively used for object matching and for inference of the image registration warping function. For this end, a novel, robust, and efficient method for non-rigid image registration using DSW in the “length–code” domain is ...

The lithography used for 32 nanometers and smaller VLSI process technologies restricts the admissible interconnect widths and spaces to very few discrete values with some interdependencies, making traditional interconnect sizing by continuous-variable optimization techniques impossible. Single-net bottom-up power-delay optimization for discrete wire widths has been solved and got a lot of atten...

Abstract The article presents an efficient method of optimal thrust allocation over the actuators in a dynamically positioned ship, according to DNV-ST-0111 standard, Level 1. optimisation task is approximated convex problem with linear constraints and mathematically formulated as quadratic programming. case study being used illustrate use proposed approach assessing DP capability rescue ship. ...

In this work, a new search procedure for statistical machine translation (SMT) is proposed that is based on dynamic programming (DP). The starting point is a DP solution to the traveling salesman problem that works by jointly processing tours that visit the same subset of cities. For SMT, the cities correspond to source sentence positions to be translated. Imposing restrictions on the order in ...

Abstract: IRIS (increasing reward with increasing service) realtime scheduling appears frequently in real-time control applications such as heuristic control. IRIS requires not only meeting deadlines, but also finding the schedule with the best result (highest reward). In this paper, a framework is presented that uses Timed Petri nets (TPN) to transform an IRIS problem into a dynamic programmin...

To capture the interdependencies between labels in multi-label classification problems, classifier chain (CC) tries to take the multiple labels of each instance into account under a deterministic high-order Markov Chain model. Since its performance is sensitive to the choice of label order, the key issue is how to determine the optimal label order for CC. In this work, we first generalize the C...

In this paper we address the problem of mapping guitar music score into one of possible alternative fingering sequences on the fretboard grid. We use dynamic programming (DP) to model the decision process of a guitarist choosing the optimal fingering sequence. To estimate the DP cost functions based on examples of guitar fingering transcriptions (tablatures) we developed an original method name...

Integration of topology data of the entire road ahead into the pow ertrain con trol unitin combination with hybrid electric pow ertrains o ers a huge potential for optimising the control strategy. The intension of the present paper is to show a methodology for computing the maximum potential of fuel saving over a speci ed route. For this o ine calculation a non-linear state-space model of the l...

To our knowledge there is only one Integer Linear Program ming ILP formulation in the literature that fully integrates all steps of code generation i e instruction selection register allocation and in struction scheduling on the basic block level We give in this paper an improved version of this ILP formulation that also covers VLIW proces sors Moreover our ILP formulation does no longer requir...

We study the fixed design segmented regression problem: Given noisy samples from a piecewise linear function f , we want to recover f up to a desired accuracy in mean-squared error. Previous rigorous approaches for this problem rely on dynamic programming (DP) and, while sample efficient, have running time quadratic in the sample size. As our main contribution, we provide new sample near-linear...