Approximating the chromatic number of an arbitrary graph using a supergraph heuristic

Testing effectiveness of genetic algorithms for exploratory data analysis

A multistage linear array assignment problem

TUD Faculty of Technical Mathematics and Informatics

An empirical comparison of seven iterative and evolutionary function optimization heuristics

A stochastic approach to the weighted-region problem

PLUM

DEPEND

Double resonances and spectral scaling in the weak turbulence theory of rotating and stratified turbulence

STR, a simple and efficient algorithm for R-Tree packing

Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems

Data partitioning and load balancing in parallel disk systems

Load balancing sequences of unstructured adaptive grids

Load balancing sequences of unstructured adaptive grids

Array distribution in data-parallel programs

Performance analysis and portability of the PLUM load balancing system

Investigations into generalization of constraint-based scheduling theories with applications to space telescope observation scheduling

Aligning parallel arrays to reduce communication

Spectral ordering techniques for incomplete LU preconditioners for CG methods

Intelligent control systems research

Improved load distribution in parallel sparse Cholesky factorization

Global load balancing with parallel mesh adaption on distributed-memory systems

Global load balancing with parallel mesh adaption on distributed-memory systems

Investigation of automated task learning, decomposition and scheduling

Weighted graph based ordering techniques for preconditioned conjugate gradient methods