The data assignment problem occurs for multiple targets tracking application. It is crucial for the overall performance. In this paper, two observations of date assignment are considered, and then a new rotational sorting algorithm based on maximum likelihood principle was presented. The given algorithm of O(logN) and O(N) complexity developed is faster than the more popularly used Hungarian ty...

The scheduling of logistic processes modeled by birth-anddeath processes is a combinatorial problem. We consider here the problem of dynamic assignment of components to orders. In this paper, a distributed algorithm based on ant colonies is proposed to optimize this assignment. The ant-agents jointly test several different combinations and choose the solution that is able to deliver more orders...

In this paper, we propose variable voltage task scheduling algorithms that minimize energy or minimize peak power for the case when the task arrival times, deadline times, execution times, periods, and switching activities are given. We consider aperiodic (earliest due date, earliest deadline first), as well as periodic (rate monotonic, earliest deadline first) scheduling algorithms. We use the...

Dynamically assigning sub-carriers in the downlink of an OFDMA based cellular system has been shown to exhibit a high potential to combat co-channel interference in according systems. So far, related investigations have assumed up-to-date channel state information as input for the sub-carrier assignment mechanisms, omitting the fact that in most cases there is a significant delay between the ti...