leads to an inlet temperature distribution that, compared to other approaches, is 2 °C to 5 °C lower and achieves about 20%-30 % cooling energy savings at common data center utilization rates. Moreover, our algorithms consistently outperform MinHR, a recirculation-reducing task placement algorithm

then extend our algorithm to exploit lazy evaluations and local structure in the GP, yielding significant speedups. We also extend our approach to find placements which are robust against node failures and uncertainties in the model. These extensions are again associated with rigorous theoretical

When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this paper, we present a data-driven approach that addresses the three

This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks with given, but unknown, time complexities onto a homogeneous network of processors with a given latency. Results

-consuming tasks in the production of maps. Consequently, several attempts have been made to automate the label-placement task for some or all classes of cartographic features (punctual, linear, or areal features), but all previously published algorithms for the most basic task---point-feature-label placement

In this paper we propose a numerical algorithm for determining optimal output feedback gains for the pole placement task for symmetric state space systems. The algorithm is based on minimizing a least squares cost criterion which is well defined even when an exact solution to the pole placement

In this paper we consider the problem of placing efficiently a rectangle in a twodimensional layout that may not have the bottom-left placement property. This problem arises when we apply any one of a number of iterative improvement algorithms to the cutting stock problem or its variants. Chazelle

the execution time of programs. Long intervals lead to long re-processing time, while too frequent checkpoint-ing leads to high checkpointing overhead. In this paper we present an on-line algorithm for placement of checkpoints. The algorithm uses on-line knowledge of the current cost of a checkpoint when

for this #nal task, based on e#cient algorithms from combinatorial optimization. 1

of the transmission distance. One approach to prolong network lifetime while preserving network connectivity is to deploy a small number of costly, but more powerful, relay nodes whose main task is communication with other sensor or relay nodes. In this paper, we assume that sensor nodes have communication range r