An n-town, n ∈ N, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid,… (More)

We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with… (More)

We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules and with… (More)

The computing resources available on dynamically partially reconfigurable devices increase every year enormously. In the near future, we expect that many applications run on a single reconfigurable… (More)

Every year the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a single reconfigurable… (More)

We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive from above, one at a… (More)

We consider the following online problem, motivated by grid computing: Given an N ×N square S, and a sequence of numbers ni with ∑i j=0 nj ≤ N; at each step i, select a region Ci of previously… (More)

In this paper we consider methods for dynamically storing a set of different objects (“modules”) in a physical array. Each module requires one free contiguous subinterval in order to be placed. Items… (More)