Many-Task Computing (MTC) is a common scenario for multiple parallel systems, such as cluster, grids, cloud and supercomputers, but it is not so popular in shared memory parallel processors. In this sense and given the spectacular growth in performance and in number of cores integrated in many-core architectures, the study of MTC on such architectures is becoming more and more relevant. In this...

We show that the full version of the so-called ‘rural hospital theorem’ generalizes to many-to-many matching problems where agents on both sides of the problem have substitutable and weakly separable preferences. We also show that when agents’ preferences satisfy substitutability, the domain of weakly separable pref-

In this note, I extend the work of Echenique (forthcoming) to show that a model of many-to-many matching with contracts may be embedded into a model of many-tomany matching with wage bargaining whenever (1) all agents’ preferences are substitutable and (2) the matching with contracts model is unitary, in the sense that every contractual relationship between a given firm–worker pair is specified...

We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which one-to-one correspondences among appearance-based features are used to construct an exemplar-based model, we search for many-tomany correspondences among qualitative shape features (multi-scale ridges and blobs) to construct a ge...