Per-ow queueing with sophisticated scheduling is a candidate architecture for networks that provide advanced Quality-of-Service (QoS) guarantees. The hardest and most interesting scheduling algorithms rely on a common computational primitive: priority queues. Large priority queues are built using calendar queue or heap data structures. To support such scheduling for a large number of ows at OC-...

This paper proposes a novel modelling and optimization approach for steady state and transient performance tune-up of an engine at idle speed. In terms of modelling, Latin hypercube sampling and multiple-input and multiple-output (MIMO) least-squares support vector machines (LS-SVMs) are proposed to build an engine idle-speed model based on experimental sample data. Then, a genetic algorithm (G...

We address the problem of ambulance dispatching, in which we must decide which ambulance to send to an incident in real time. In practice, it is commonly believed that the 'closest idle ambulance' rule is near-optimal and it is used throughout most literature. In this paper, we present alternatives to the classical closest idle ambulance rule. Most ambulance providers as well as researchers foc...

The heap is a data strudure used in many applications and provides a funfamental technique to solve many problems efficiently. In this paper I we show that a sequence of n INSERT and EXTRACT..MIN heap operations can be performed in time O(nlogmjlogp) with space Oem) on a random access machine to ,vhich a linear systolic array of p processors is attached, provided that, at any time instance, the...