Jan H. M. Korst

Learn More
Abstract. High performance applications involving large data sets require the efficient and flexible use of multiple disks. In an external memory machine with D parallel, independent disks, only one block can be accessed on each disk in one I/ O step. This restriction leads to a load balancing problem that is perhaps the main inhibitor for the efficient(More)
An approach is presented for storing video data in large disk arrays. Video data is stored by assigning a number of copies of each data block to different, randomly chosen disks, where the number of copies may depend on the popularity of the corresponding video data. The approach offers an interesting alternative to the well-known striping techniques. Its(More)
This paper discusses improved force-directed scheduling and its application in the design of high-throughput DSP systems, such as real-time video VLSI circuits. We present a mathematical justification of the technique of force-directed scheduling, introduced by Paulin and Knight, and we show how the algorithm can be used to find cost-effective time(More)
We discuss the problem of solving (approximately) combinatorial optimization problems on a Boltzmann machine. It is shown for a number of combinatorial optimization problems how they can be mapped directly onto a Boltzmann machine by choosing appropriate connection patterns and connection strengths. In this way maximizing the consensus in the Boltzmann(More)
“Theoretical aspects of local search? That must be like two pages long!” said a seasoned theoretical computer scientist, when he learned what a book was under review. Many computer scientists do indeed share a scathing contempt for anything heuristic. Perhaps this is because they do not realise that many real-life optimisation problems do boil down to large(More)
We present a novel approach in categorizing artists into subjective categories such as genre. We base our method on co-occurrences on the web, found with the Google search engine. A direct mapping between artists and categories proved to be unreliable. We use the categories mapped to closely related artists to obtain a more reliable mapping. The method is(More)
We consider the problem of partitioning a set of n numbers into m subsets of cardinality k n m or n m , such that the maximum subset sum is minimal. We prove that the performance ratios of the Differencing Method of Karmarkar and Karp for k 3 4 5 and 6 are precisely 4/3, 19/12, 103/60, and 643/360, respectively, by means of a novel approach in which the(More)