We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
An increasing number of science and engineering applications require distributed and parallel computing resources to satisfy user response-time requirements. Distributed science a...
Kenneth A. Hawick, Heath A. James, Craig J. Patten...
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...