Bag-of-Distributed-Tasks (BoDT) application is the collection of identical and independent tasks each of which requires a piece of input data located around the world. As a result, Cloud computing offers an effective way to execute BoT application as it not only consists of multiple geographically distributed data centres but also allows a user to pay for what she actually uses only. In this pa...

A* is the algorithm of finding the shortest path between two nodes in a graph. When the searching problem is constituted of a set of linked graphs, A* searches solution like if it is face of one graph formed by linked graphs. While researchers have developed solutions to reduce the execution time of A* in multiple cases by multiples techniques, we develop a new algorithm: DEC-A* which is a dece...

This paper examines the interesting problem of designing seating plans for large events such as weddings and gala dinners where, amongst other things, the aim is to construct solutions where guests are sat on the same tables as friends and family but, perhaps more importantly, are kept away from those they dislike. This problem is seen to be NP-complete from a number of different perspectives. ...

In this note we cast parametrization of certain type of covariance extension problems in polynomial model. We show that the Kimura form of state space realization for maximum entropy solution to Carathéodory’s extension problem is Riccati balanced parametrization. As an application we provide a heuristic algorithm for finding solutions to minimum-phase spectral factor with poles and zeros, give...

In previous work, we have introduced an effective, grammarbased, linear Genetic-Programming hyperheuristic, i.e., a search heuristic on the space of heuristics. Here we further investigate this approach in the context of search performance and resource utilisation. For the chosen realistic travelling salesperson problems it shows that the hyperheuristic routinely produces metaheuristics that fi...

We formulate combined register allocation and instruction scheduling within a basic block as a single optimization problem, with an objective cost function that more directly captures the primary measure of interest in code optimization — the completion time of the last instruction. We show that although a simple instance of the combined problem is NP-hard, the combined problem is much easier t...