A key component of an efficient multipath routing is the optimal traffic allocation strategy that deals with how the traffic should be distributed among the multiple paths. In this study, two intelligent traffic distribution policies that minimise the experienced delay by the end user are proposed. For such delay minimisation, the authors investigate and compare average delay minimisation and m...

We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomialtime minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with floating-point arithmetic. Our algorithm can also be used for “lossy” minimisation with bounded error. We show an application in image compression. In the secon...

This paper discusses chronological minimisation and the problem of representing common sense explanatory causal reasoning. The background of chronological minimisation is brieey surveyed. Then prioritised chronological minimisation is introduced. Finally, it is shown that this can be used as a basis for representing explanation.

Hyper-minimisation of deterministic nite automata is a recently introduced state reduction technique that allows a nite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semi elds is presented, which allows the recognised formal power series to di er for nitely many input strings. First, the structure of hyper-minimal deterministic...

Hyper-minimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal power series to differ for finitely many input strings. First, the structure of hyper-minimal deter...

Event structures are fundamental models in concurrency theory, providing a representation of events computation and their relations, notably concurrency, conflict causality. In this paper we present theory minimisation for event structures. Working class that generalises many stable structure the literature (e.g., prime, asymmetric, flow bundle structures), study notion behaviour-preserving quo...

BACKGROUND Minimisation can be used within treatment trials to ensure that prognostic factors are evenly distributed between treatment groups. The technique is relatively straightforward to apply but does require running tallies of patient recruitments to be made and some simple calculations to be performed prior to each allocation. As computing facilities have become more widely available, min...

The major objective of this study is to find accuracy in movie suggestion systems using machine learning algorithms namely Empirical Risk Minimisation Algorithm and Decision Tree Algorithm. algorithm with sample size N = 10 was iterated 20 times for finding systems.The riskminimisation produces a better [92.02%] than the tree [80.58%]. significance risk minimisation[p<0.05] independent T-tes...

The UK waste strategy is based upon a concept of a hierarchy of preferable options for handling and disposal of waste. Minimisation is at the top of this hierarchy and several policy strategies have been introduced to encourage the uptake of waste minimisation methodology by industry. Waste minimisation clubs are a key component of the UK waste strategy and an essential vehicle for encouraging ...