In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 and ρ2-competitive for minimizing f2. A...

A direct method is offered for numerical solution of free-horizon optimal control problems. The method first represents the problem with discrete dynamics. Next, given a fixed number of decisions, not only the decisions, but also the decision frequencies are optimised to construct the optimal...

We survey the main applications of algorithmic (Kolmogorov) complexity to the problem of price dynamics in financial markets. We stress the differences between these works and put forward a general algorithmic framework in order to highlight its potential for financial data analysis. This...

The use of non-iterative shortest route algorithm for finding shortest route between points in a network is illustrated. The non-iterative approach can be applied to various network problems that can be solved using shortest route algorithm and provides a solution with much less effort. The...

Adaptive sample size and sampling intervals schemes have been widely used to improve the statistical efficiency of Hotelling T² control chart in detecting small changes when the quality of a product or a process can be characterised by the multivariate distribution of quality characteristics....

Machining operations are used for creating surfaces by cutting away unwanted materials from workpieces. These operations are highly constrained and non-linear in nature. As a result traditional techniques are not suitable for machining parameter optimisation. Turning and milling are the two most...