The theory of dynamic polynomial combinants is linked to the linear part of the Dynamic Determinantal Assignment Problems, which provides the unifying description of the pole and zero dynamic assignment problems in Linear Systems. The fundamentals of the theory of dynamic polynomial combinants have been recently developed by examining issues of their representation, parameterization of dynamic ...

During a disaster, victims with varied morbidities are located at incident sites, while healthcare facilities with varied healthcare resources are distributed elsewhere. Transportation serves an essential equilibrating role: it helps balance the patients' need for care with the supply of care. Studying the special case of New York City, this article sets out the healthcare transportation compon...

The problem of ensuring agents work as an effective team in dynamic distributed environments still remains a challenging issue. In this paper we proposed a role-based team model. In our model, the role characterizes the responsibilities and provides logic patterns to achieve certain goals and cooperate with others. The agent is an autonomous execution unit and follows the logic patterns that th...

The theory of constant polynomial combinants has been well developed [2] and it is linked to the linear part of the constant Determinantal Assignment problem [1] that provides the unifying description of the pole and zero assignment problems in Linear Systems. Considering the case of dynamic pole, zero assignment problems leads to the emergence of dynamic polynomial combinants. This paper aims ...

This report examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed clustering techniques run into unique problems as issue width and cluster count increase. Realistic design conditions, such as variable data forwarding latencies between clusters and a heavily partitioned instruction window also increase the degree of difficulty for effective cluste...