A fundamental problem in distributed computing is the distribution of requests to a set of uniformservers without a centralized controller. Classically, such problems are modelled as static balls intobins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work,Azar et al. [4] proposed the sequential strategy Greedy[d] for n = m. When thrown,...

In this work, we present a modification of an algorithm for solving the permutation ambiguity in convolutive blind source separation. A well known approach for separation of convolutive mixtures is the transformation to the time-frequency domain, where the convolution becomes a multiplication. With this approach it is possible to use well known instantaneous ICA algorithms independently in each...