2014-066 Cloud-Based Velocity Profile Optimization for Everyday Driving: A DynamicProgramming-Based Solution E Ozatay, S Onori, J Wollaeger, U Ozguner, G Rizzoni, D Filev, J Michelini, S Di Cairano IEEE Trans. on Intelligent Transportation Systems, online, 2014 Use of a distinct computing platform to compute optimal speed profiles via DP.

In this paper we continue our investigation of stochastic (and hence dynamic) variants of classical scheduling problems. Such problems can be modeled as duration probabilistic automata (DPA), a well-structured class of acyclic timed automata where temporal uncertainty is interpreted as a bounded uniform distribution of task durations [18]. In [12] we have developed a framework for computing the...

We present an approach to computing a curve atlas based on deriving a correspondence between two curves. This correspondence is based on a notion of an alignment curve and on a measure of similarity between the intrinsic properties of the curve, namely, length and curvature. The optimal correspondence is found by an efficient dynamicprogramming method. This is then used to compute an average fo...

In this work, we cast the continuous voltage assignment problem as a minimum convexcost network flow problem to solve it both optimally and efficiently. Experiments show that, on real circuits, our algorithm is two orders of magnitude (100X) faster than previous work [1]. Another research group independently developed and published the continuous voltage assignment algorithm that we describe [2...

FIR filters are used in many performance/power critical applications such as mobile communication devices, analogue to digital converters and digital signal processing applications. Design of appropriate FIR filters usually causes the order of filter to be increased. Synthesis and tape-out of high-order FIR filters with reasonable delay, area and power has become an important challenge for hard...

We present a program qhash, based on q-gram filtration and high-dimensional search, to find gapped local similarities between two sequences. Our approach differs from past q-gram-based approaches in two main aspects. Our filtration step uses algorithms for a sparse all-pairs problem, while past studies use suffix-tree-like structures and counters. Our program works in sequence-sequence mode, wh...

I describe two new methods for estimating the optimal treatment regime (equivalently, protocol, plan or strategy) from very high dimesional observational and experimental data: (i) g-estimation of an optimal double-regime structural nested mean model (drSNMM) and (ii) g-estimation of a standard single regime SNMM combined with sequential dynamicprogramming (DP) regression. These methods are com...

In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sharing with tabled search. It is also shown that this general framework achieves the same time complexity as that of the specialized algorithms. The efficiency is brought by sharing common (partial) paths in the derivation tree ...

Spelling correction is an important component of any system for processing text. Agglutinative languages such as Turkish or Finnish, differ from languages like English in the way lexical forms are generated. Typical nominal or a verbal root may generate thousands (or even millions) of valid forms which never appear in the dictionary. For instance, we can give the following (rather exaggerated) ...

In this article the place and capacity of combined heat and power [CHP] prediction unit wasdetermined dynamically with use of modified particle swarm optimization (MPSO). It was done inoptimization palace and with a capacity of CHP as a production resource with the aim to increasethe reliability capacity. Decrease the loss and provide the electrical and thermal energies ofindustrial city. The f...